Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Authors
Keywords
-
Journal
JOURNAL OF THE ACM
Volume 67, Issue 1, Pages 1-54
Publisher
Association for Computing Machinery (ACM)
Online
2020-01-16
DOI
10.1145/3375890
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Prefix-free parsing for building big BWTs
- (2019) Christina Boucher et al. Algorithms for Molecular Biology
- Time–space trade-offs for Lempel–Ziv compressed indexing
- (2018) Philip Bille et al. THEORETICAL COMPUTER SCIENCE
- Universal compressed text indexing
- (2018) Gonzalo Navarro et al. THEORETICAL COMPUTER SCIENCE
- Document listing on repetitive collections with guaranteed performance
- (2018) Gonzalo Navarro THEORETICAL COMPUTER SCIENCE
- Time-Optimal Top-$k$ Document Retrieval
- (2017) Gonzalo Navarro et al. SIAM JOURNAL ON COMPUTING
- Universal indexes for highly repetitive document collections
- (2016) Francisco Claude et al. INFORMATION SYSTEMS
- A really simple approximation of smallest grammar
- (2016) Artur Jeż THEORETICAL COMPUTER SCIENCE
- Optimal Lower and Upper Bounds for Representing Sequences
- (2015) Djamal Belazzougui et al. ACM Transactions on Algorithms
- Random Access to Grammar-Compressed Strings and Trees
- (2015) Philip Bille et al. SIAM JOURNAL ON COMPUTING
- Approximation of grammar-based compression via recompression
- (2015) Artur Jeż THEORETICAL COMPUTER SCIENCE
- Big Data: Astronomical or Genomical?
- (2015) Zachary D. Stephens et al. PLOS BIOLOGY
- Fully Functional Static and Dynamic Succinct Trees
- (2014) Gonzalo Navarro et al. ACM Transactions on Algorithms
- Alphabet-Independent Compressed Text Indexing
- (2014) Djamal Belazzougui et al. ACM Transactions on Algorithms
- The DNA data deluge
- (2013) M. C. Schatz et al. IEEE SPECTRUM
- Fast relative Lempel–Ziv self-index for similar sequences
- (2013) Huy Hoang Do et al. THEORETICAL COMPUTER SCIENCE
- Fast gapped-read alignment with Bowtie 2
- (2012) Ben Langmead et al. NATURE METHODS
- On compressing and indexing repetitive sequences
- (2012) Sebastian Kreft et al. THEORETICAL COMPUTER SCIENCE
- Fully compressed suffix trees
- (2011) Luís M. S. Russo et al. ACM Transactions on Algorithms
- The sequence read archive: explosive growth of sequencing data
- (2011) Y. Kodama et al. NUCLEIC ACIDS RESEARCH
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- (2011) Johannes Fischer et al. SIAM JOURNAL ON COMPUTING
- Wee LCP
- (2010) Johannes Fischer INFORMATION PROCESSING LETTERS
- Storage and Retrieval of Highly Repetitive Sequence Collections
- (2010) Veli Mäkinen et al. JOURNAL OF COMPUTATIONAL BIOLOGY
- Faster entropy-bounded compressed suffix trees
- (2009) Johannes Fischer et al. THEORETICAL COMPUTER SCIENCE
- Ultrafast and memory-efficient alignment of short DNA sequences to the human genome
- (2009) Ben Langmead et al. GENOME BIOLOGY
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started