1G. Navarro. A guided tour to approximate string matching. ACM Computing surveys (CSUR), 33(1):31-88, 2001.
2P. H. Sellers. The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms, 1 (4):359-373,1980.
3R. Baeza-Yates. A unified view of string matching algorithms. In Proceedings of the Theory, and Practice of Informatics(SOFSEM'96).LNCS,vol. 1175, Springer Verlag, 1996.
4V. Crescenzi, G MeccaG, P. Merialdo. RoadRunner: Towards automatic data extraction from large Web sites. Proceedings of the26th International Conference on Very Large Database Systems (VLDB), Rome, Italy, pp. 109-118, 2001.
5A. Arasu, and H. Garcia-Molina, Extracting structured data from Web pages. Proceedings of the ACM SIGMOD International Conference on Management of Data, San Diego, California, pp. 337-348, 2003.
6D. Reis, P. Golgher, A. Silva, A. Laender, A. Automatic Web news extraction using tree edit distance, WWW-04, 20040.
7C. Chai-Hui, K. Mohanmmed . A Survey of Web Information Extraction Systems, IEEE Transactiom on Knowledge and Data Engineering, Vol .18, 2006.
8G. Navarro, M. Raffinot. Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences. Cambridge Press, 2002.
9V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8-17, 1965.
10E. Ukkonen. Algorithms for approximate string matching. Information and Control 64,100-118. Preliminary version in Proceedings of the International Conference Foundations of Computation Theory (LNCS, vol. 158, 1983).
