Full-Text Indexes for High-Throughput Sequencing
From MaRDI portal
Publication:3305517
DOI10.1007/978-3-319-59826-0_2zbMath1457.68076OpenAlexW2756074012MaRDI QIDQ3305517
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_2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Replacing suffix trees with enhanced suffix arrays
- A space and time efficient algorithm for constructing compressed suffix arrays
- Data structures and algorithms for approximate string matching
- On-line construction of suffix trees
- A comparison of imperative and purely functional suffix tree constructions
- Lightweight data indexing and compression in external memory
- An extension of the Burrows-Wheeler transform
- The exact online string matching problem
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- An analysis of the Burrows—Wheeler transform
- Indexing compressed text
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Error Detecting and Error Correcting Codes
- Lightweight LCP Construction for Next-Generation Sequencing Datasets
- A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
- External Memory Generalized Suffix and LCP Arrays Construction
- From Indexing Data Structures to de Bruijn Graphs
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- On the sorting-complexity of suffix tree construction