Indexing a sequence for mapping reads with a single mismatch
From MaRDI portal
Publication:2955639
DOI10.1098/rsta.2013.0167zbMath1353.68314OpenAlexW1975487092WikidataQ38913414 ScholiaQ38913414MaRDI QIDQ2955639
Alessio Langiu, M. Sohel Rahman, Maxime Crochemore
Publication date: 13 January 2017
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rsta.2013.0167
Related Items (1)
Cites Work
- A fast algorithm for string matching with mismatches
- From Nerode's congruence to suffix automata with mismatches
- Replacing suffix trees with enhanced suffix arrays
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
- Fast pattern-matching on indeterminate strings
- Efficient string matching with k mismatches
- Parallel string matching with k mismatches
- Fast string matching with mismatches
- On-line construction of suffix trees
- Indexing factors with gaps
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- When indexing equals compression
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Indexing compressed text
- AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS
- Generalized String Matching
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- Text Indexing and Dictionary Matching with One Error
- Faster algorithms for string matching with k mismatches
This page was built for publication: Indexing a sequence for mapping reads with a single mismatch
