Algorithms for Indexing Highly Similar DNA Sequences
From MaRDI portal
Publication:3305514
DOI10.1007/978-3-319-59826-0_1zbMath1457.68332OpenAlexW2754235768MaRDI QIDQ3305514
Thierry Lecroq, Mourad Elloumi, Nadia Ben Nsira
Publication date: 7 August 2020
Published in: Algorithms for Next-Generation Sequencing Data (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59826-0_1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate string matching with suffix automata
- The smallest automaton recognizing the subwords of a text
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- On-line construction of compact directed acyclic word graphs
- Engineering a lightweight suffix array construction algorithm
- On-line construction of suffix trees
- Faster suffix sorting
- Suffix Tree of Alignment: An Efficient Index for Similar Data
- Fast Relative Lempel-Ziv Self-index for Similar Sequences
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Encyclopedia of Database Systems
- Indexing compressed text
- Linear-Time Construction of Suffix Arrays
- Space Efficient Linear Time Construction of Suffix Arrays
- Indexing Similar DNA Sequences
- Orthogonal Range Searching in Linear and Almost-Linear Space
- Efficient string matching
- A Space-Economical Suffix Tree Construction Algorithm
- On the Complexity of Finite Sequences
- Algorithms on Strings, Trees and Sequences
- New text indexing functionalities of the compressed suffix arrays
- Complete inverted files for efficient text retrieval and analysis
- Reducing the Space Requirement of LZ-Index
- Combinatorial Pattern Matching
- String Processing and Information Retrieval
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- On the sorting-complexity of suffix tree construction
- Elements of Information Theory
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
