A guided tour to approximate string matching

@article{Navarro2001AGT,
  title={A guided tour to approximate string matching},
  author={G. Navarro},
  journal={ACM Comput. Surv.},
  year={2001},
  volume={33},
  pages={31-88}
}
  • G. Navarro
  • Published 2001
  • Computer Science
  • ACM Comput. Surv.
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… Expand
A Hybrid Indexing Method for Approximate String Matching
Fast Algorithms for Top-k Approximate String Matching
A Novel Algorithm for String Matching with Mismatches
Survey of Spatial Approximate String Search
Efficient Merging and Filtering Algorithms for Approximate String Searches
A Study on Similar String Matching
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 30 REFERENCES
A Comparison of Approximate String Matching Algorithms
Fast Two-Dimensional Approximate Pattern Matching
A new approach to text searching
Fast and Practical Approximate String Matching
Approximate string matching using withinword parallelism
  • A. Wright
  • Computer Science
  • Softw. Pract. Exp.
  • 1994
Practical fast searching in strings
Combinatorial Algorithms on Words
Algorithms for Approximate String Matching
  • E. Ukkonen
  • Computer Science, Mathematics
  • Inf. Control.
  • 1985
Pattern matching with swaps
Fast approximate string matching with q-blocks sequences
  • Proceedings of the 3rd South American Workshop on String Processing (WSP'96
  • 1996
...
1
2
3
...