A guided tour to approximate string matching

by: Gonzalo Navarro

ACM Computing Surveys, Vol. 33, No. 1. (2001), pp. 31-88.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

ianturton, paulovn, dmeister, dmolla, snowman, parmentierf, derek_farn, pdlug, myelin, vidal31, zielaj, michaelmampaey, inference-group (group), ADMiRes (group)

Find related articles with these CiteULike tags

algorithm, approximate, approximate-matching, approximate-searching, approximate-string, edit-distance, informationretrieval, information-retrieval, ir, matching, no-tag, string, string-matching, strings, survey, text, text-mining

Abstract

We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to...

@article{citeulike:128165, abstract = {We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to...}, author = {Navarro, Gonzalo }, citeulike-article-id = {128165}, journal = {ACM Computing Surveys}, number = {1}, pages = {31--88}, posted-at = {2006-03-17 18:40:28}, priority = {2}, title = {A guided tour to approximate string matching}, url = {http://citeseer.ist.psu.edu/navarro99guided.html}, volume = {33}, year = {2001} }

RIS record

TY - JOUR ID - citeulike:128165 L3 - citeulike-article-id:128165 TI - A guided tour to approximate string matching JF - ACM Computing Surveys VL - 33 IS - 1 SP - 31 EP - 88 N2 - We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to... AU - Navarro, Gonzalo PY - 2001/// UR - http://citeseer.ist.psu.edu/navarro99guided.html ER -

RIS BibTeX