Pages that link to "Item:Q689099"
From MaRDI portal
The following pages link to Approximate string matching with suffix automata (Q689099):
Displaying 14 items.
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- A dynamic edit distance table (Q876720) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Sublinear approximate string matching and biological applications (Q1336963) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- On-line construction of suffix trees (Q1897476) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- On minimizing pattern splitting in multi-track string matching (Q2569400) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
