Combinatorial Pattern Matching

Volume 807 of the series Lecture Notes in Computer Science pp 240-249


Approximate string matching with don't care characters

  • Tatsuya AkutsuAffiliated withMechanical Engineering Laboratory

* Final gross prices may vary according to local VAT.

Get Access


This paper presents parallel and serial approximate matching algorithms for strings with don't care characters. They are based on Landau and Vishkin's approximate string matching algorithm and Fisher and Paterson's exact string matching algorithm with don't care characters. The serial algorithm works in O(√kmn log¦Σ¦ log2 m/k log log m/k) time, and the parallel algorithm works in O(k log m) time using O(√m/kn log ¦Σ¦ log m/k log log m/k) Processors on a CRCW-PRAM, where n denotes the length of a text string, m denotes the length of a pattern string, k denotes the maximum number of differences, and ∑ denotes the alphabet (i.e. the set of characters). Several extensions are also described.


approximate string matching don't care characters sequence analysis