Fast and Practical Approximate String Matching (1992)
| Venue: | In Combinatorial Pattern Matching, Third Annual Symposium |
| Citations: | 47 - 0 self |
BibTeX
@INPROCEEDINGS{Baeza-yates92fastand,
author = {Ricardo A. Baeza-yates and Chris H. Perleberg},
title = {Fast and Practical Approximate String Matching},
booktitle = {In Combinatorial Pattern Matching, Third Annual Symposium},
year = {1992},
pages = {185--192},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present new algorithms for approximate string matching based in simple, but efficient, ideas. First, we present an algorithm for string matching with mismatches based in arithmetical operations that runs in linear worst case time for most practical cases. This is a new approach to string searching. Second, we present an algorithm for string matching with errors based on partitioning the pattern that requires linear expected time for typical inputs. 1 Introduction Approximate string matching is one of the main problems in combinatorial pattern matching. Recently, several new approaches emphasizing the expected search time and practicality have appeared [3, 4, 27, 32, 31, 17], in contrast to older results, most of them are only of theoretical interest. Here, we continue this trend, by presenting two new simple and efficient algorithms for approximate string matching. First, we present an algorithm for string matching with k mismatches. This problem consists of finding all instances o...
