Pages that link to "Item:Q616995"
From MaRDI portal
The following pages link to The longest common extension problem revisited and applications to approximate string searching (Q616995):
Displaying 13 items.
- Longest common extensions in trees (Q294947) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- Longest common extension (Q1678103) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- Searching and Indexing Circular Patterns (Q3305518) (← links)
