2001 AGuidedTourToApproxStrMatch
Jump to navigation
Jump to search
- (Navarro, 2001) ⇒ Gonzalo Navarro. (2001). “A Guided Tour to Approximate String Matching.” In: ACM Computing Surveys (CSUR), 33(1). doi:10.1145/375360.375365
Subject Headings: Approximate String Matching Algorithm, String Distance Function.
Notes
- A possibly friendlier PDF version http://www.cs.ucf.edu/~dcm/Teaching/COT4810-Spring2011/Literature/ApproximativeStringMatching.pdf
- A PS version ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/survasm.ps.gz
Cited By
- ~1022 http://scholar.google.com/scholar?q=%22A+Guided+Tour+to+Approximate+String+Matching%22+2001
- ~232 http://portal.acm.org/citation.cfm?doid=375360.375365&preflayout=flat#citedby
2006
- (Zezula et al., 2006) ⇒ Pavel Zezula, Giuseppe Amato, Vlastislav Dohnal, and Michal Batko. (2006). “Similarity Search: The Metric Space Approach”. Springer, Advances in Database Systems. ISBN:0387291466
Quotes
Abstract
We survey the current techniques to cope with the problem of string matching that allows 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 compare the performance of the different algorithms and show which are the best choices. We conclude with some directions for future work and open problems.
References
,
Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
---|---|---|---|---|---|---|---|---|---|---|
2001 AGuidedTourToApproxStrMatch | Gonzalo Navarro | A Guided Tour to Approximate String Matching | http://www.dcc.uchile.cl/~gnavarro/ps/acmcs01.1.pdf | 10.1145/375360.375365 |