Fast Two-Dimensional Approximate Pattern Matching


We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions and deletions). Although the problem can be solved using dynamic programming in time O(m 2 n 2), this is in general too expensive for small k. So we design a ltering algorithm… (More)
DOI: 10.1007/BFb0054334


  • Presentations referencing similar topics