Pages that link to "Item:Q1109574"
From MaRDI portal
The following pages link to Fast string matching with k differences (Q1109574):
Displaying 27 items.
- Pattern matching in pseudo real-time (Q533411) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- A dynamic edit distance table (Q876720) (← links)
- String matching with weighted errors (Q909451) (← links)
- Matching patterns in strings subject to multi-linear transformations (Q1115200) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Sublinear approximate string matching and biological applications (Q1336963) (← links)
- Pattern matching in a digitized image (Q1336966) (← links)
- Improved approximate pattern matching on hypertext (Q1566744) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Approximate pattern matching and transitive closure logics. (Q1874401) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- 2-dimensional palindromes with \(k\) mismatches (Q2203604) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- On minimizing pattern splitting in multi-track string matching (Q2569400) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Double string tandem repeats (Q2700385) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- Algorithms For Computing Approximate Repetitions In Musical Sequences (Q4780537) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
