Approximate string matching by finite automata

  • Bořivoj Melichar
Conference paper

DOI: 10.1007/3-540-60268-2_315

Volume 970 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Melichar B. (1995) Approximate string matching by finite automata. In: Hlaváč V., Šára R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg

Abstract

Approximate string matching is a sequential problem and therefore it is possible to solve it using finite automata. A nondeterministic finite automaton is constructed for string matching with k mismatches. It is shown, how “dynamic programming” and “shift- and” based algorithms simulate this nondeterministic finite automaton. The corresponding deterministic finite automaton have \(\mathcal{O}(m^{k + 1} )\) states, where m is the length of the pattern and k is the number of mismatches. The time complexity of algorithms based on such deterministic finite automaton is \(\mathcal{O}(n)\), where n is the length of text.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Bořivoj Melichar
    • 1
  1. 1.Department of Computer Science and Engineering, Faculty of Electrical EngineeringCzech Technical UniversityPrague 2Czech Republic