Approximate pattern matching on elastic-degenerate text
From MaRDI portal
Publication:2297854
DOI10.1016/j.tcs.2019.08.012zbMath1437.68207OpenAlexW2968539773MaRDI QIDQ2297854
Giulia Bernardini, Nadia Pisanti, Giovanna Rosone, Solon P. Pissis
Publication date: 20 February 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/28825
Related Items
Algorithms and complexity on indexing founder graphs ⋮ Matching patterns with variables under edit distance ⋮ Elastic-degenerate string matching with 1 error ⋮ Efficient pattern matching in elastic-degenerate strings ⋮ Comparing Degenerate Strings ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast pattern-matching on indeterminate strings
- Covering problems for partial words and for indeterminate strings
- FM-index of alignment with gaps
- Fast and practical approximate string matching
- Efficient pattern matching in elastic-degenerate strings
- Indexing Highly Repetitive Collections
- On-Line Pattern Matching on Uncertain Sequences and Applications
- Faster Approximate Pattern Matching in Compressed Repetitive Texts
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Generalized String Matching
- Algorithms on Strings, Trees and Sequences
- Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
- On-line pattern matching on similar texts
- Faster Online Elastic Degenerate String Matching
- Pattern Matching on Elastic-Degenerate Text with Errors
- Indexing Variation Graphs
- Random Access to Grammar-Compressed Strings and Trees
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
This page was built for publication: Approximate pattern matching on elastic-degenerate text
