Pages that link to "Item:Q5056116"
From MaRDI portal
The following pages link to Boyer-Moore approach to approximate string matching (Q5056116):
Displaying 13 items.
- Accelerating Boyer-Moore searches on binary texts (Q840783) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- An approximate string-matching algorithm (Q1190457) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Application of max-plus algebra to biological sequence comparisons (Q1870593) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- An Improved Algorithm For Approximate String Matching (Q3495647) (← links)
- Accelerating Boyer Moore Searches on Binary Texts (Q3503901) (← links)
- Finding approximate patterns in strings (Q3681960) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Combinatorial Pattern Matching (Q5713571) (← links)