Approximate Boyer–Moore String Matching
From MaRDI portal
Publication:4032935
Recommendations
Cited in
(19)- An improved algorithm for computing the edit distance of run-length coded strings
- On using q-gram locations in approximate string matching
- A subquadratic algorithm for approximate limited expression matching
- An approximate string-matching algorithm
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- Approximate Boyer-Moore string matching for small alphabets
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
- Fast parameterized matching with \(q\)-grams
- The Boyer-Moore-Horspool heuristic with Markovian input
- On the string matching with \(k\) mismatches
- New and faster filters for multiple approximate string matching
- Edit distance for a run-length-encoded string and an uncompressed string
- Approximate string matching with reduced alphabet
- A new filtration method and a hybrid strategy for approximate string matching
- IDPM: an improved degenerate pattern matching algorithm for biological sequences
- Two glass balls and a tower
- Boyer-Moore approach to approximate string matching
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- On-line approximate string matching with bounded errors
This page was built for publication: Approximate Boyer–Moore String Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032935)