Approximate Boyer–Moore String Matching
From MaRDI portal
Publication:4032935
DOI10.1137/0222018zbMath0770.68074MaRDI QIDQ4032935
Publication date: 17 May 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222018
Related Items
New and faster filters for multiple approximate string matching, On-Line Approximate String Searching Algorithms: Survey and Experimental Results, Bit-Parallel Approximate Matching of Circular Strings with k Mismatches, IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences, A new filtration method and a hybrid strategy for approximate string matching, On-line approximate string matching with bounded errors, An improved algorithm for computing the edit distance of run-length coded strings, Fast parameterized matching with \(q\)-grams, On the string matching with \(k\) mismatches, A subquadratic algorithm for approximate limited expression matching, Approximate Boyer-Moore string matching for small alphabets, Edit distance for a run-length-encoded string and an uncompressed string