String matching with k differences by finite automata

Proceedings - International Conference on Pattern Recognition

Volumn 2, Issue , 1996, Pages 256-260

  Melichar, Borivoj ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN RECOGNITION;

APPROXIMATE STRING MATCHING; DETERMINISTIC FINITE AUTOMATA; NONDETERMINISTIC FINITE AUTOMATON; SEQUENTIAL PROBLEMS; SHIFT-AND; STRING MATCHING; TIME COMPLEXITY;

FINITE AUTOMATA;

EID: 84898832869     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.1996.546828     Document Type: Conference Paper

References (7)

1. Aho, A., Ullman, J.: The theory of parsing, translation and compiling. Vol. I: Parsing, Prentice Hall, Englewood Cliffs, New York 1972.
2. Baeza-Yates, R., Gönnet, G. H.: A new approach to text searching. Communications of the ACM, October 1992, Vol. 35, No. 10, pp. 74-82.
3. Melichar, B.: Approximate string matching by finite automata. In: Hlavač, V., Šara, R. (eds.) Computer Analysis of Images and Patterns, LNCS 970, Springer 1995, pp. 342-349.
4. Manber, U., Wu, S.: Approximate pattern matching. BYTE, November 1992, pp. 281-292.
5. Ukkonen, E.: Finding approximate patterns in strings. Journal of algorithms 6, 1985, pp. 132-137.
6. Wagner, R., A., Fischer, M., J.: The string-to-string correction problem. Journal of the ACM, January 1974, Vol. 21, No. 1, pp. 168-173.
7. Wu, S., Manber, U.: Fast text searching allowing errors. Communications of the ACM, October 1992, Vol. 35, No. 10, pp. 83-91.