String-Matching and Alignment Algorithms for Finding Motifs in NGS Data
From MaRDI portal
Publication:3305534
DOI10.1007/978-3-319-59826-0_11zbMath1457.68333WikidataQ57924576 ScholiaQ57924576MaRDI QIDQ3305534
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_11
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Textual data compression in computational biology: algorithmic techniques
- A completeness theorem for Kleene algebras and the algebra of regular events
- On-line construction of suffix trees
- A fast string searching algorithm
- Efficient randomized pattern-matching algorithms
- A Space-Economical Suffix Tree Construction Algorithm
- Partial-Match Retrieval Algorithms
- Fast Pattern Matching in Strings
- Algorithms on Strings, Trees and Sequences
- An introduction to Kolmogorov complexity and its applications