Pages that link to "Item:Q4032935"
From MaRDI portal
The following pages link to Approximate Boyer–Moore String Matching (Q4032935):
Displaying 12 items.
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences (Q4639924) (← links)
