Faster filters for approximate string matching

Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2007, Pages 84-90

  Kärkkäinen, Juha ^a   Na, Joong Chae ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DIGITAL FILTERS; INDEXING (OF INFORMATION); STRING THEORY; TEXT PROCESSING;

APPROXIMATE STRING MATCHING; FALSE MATCHES; FASTER FILTERS; SUFFIX FILTERS;

INTEGER PROGRAMMING;

EID: 34547953324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972870.8     Document Type: Conference Paper

References (16)

1. R. A. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2): 127-158, 1999.
2. S. Burkhardt and J. Kärkkäinen. Better filtering with gapped q-grams. Fundam. Informaticae, 56(1-2):51-70, 2003.
3. H.-L. Chan, T.-W. Lam, W.-K. Sung, S.-L. Tarn, and S.-S. Wong. A linear size index for approximate pattern matching. In Proc. 17th Annual Symposium on Combinatorial Pattern Matching, volume 4009, pages 49-59. Springer, 2006.
4. A. L. Cobbs. Fast approximate matching using suffix trees. In Z. Galil and E. Ukkonen, editors, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, number 937 in LNCS, pages 41-54. Springer, 1995.
5. L. Coelho and A. Oliveira. A structure for approximate text indexing. In Proc. 13th Symposium on String Processing and Information Retrieval. Springer, Oct. 2006. To appear.
6. R. Cole, L.-A. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. In Proceedings of the thirty-sixth annual ACM Symposium on Theory of Computing (STOC-O4), pages 91-100. ACM Press, 2004.
7. H. Hyyrö. Explaining and extending the bit-parallel algorithm of Myers. Technical Report A-2001-10, Department of Computer and Information Sciences, University of Tampere, 2001.
8. B. Ma, J. Tromp, and M. Li. PatternHunter: Faster and more sensitive homology search. Bioinformatics, 18:440-445, 2002.
9. M. G. Maaß and J. Nowak. Text indexing with errors. In Proc. 16th Annual Symp. on Combinatorial Pattern Matching (CPM), volume 3537 of LNCS, pages 21-32. Springer, June 2005.
10. E. W. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374, 1994.
11. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM, 46(3):395-415, 1999.
12. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
13. G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms, 1(1):205-239, 2000. Special issue on Matching Patterns.
14. G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4): 19-27, 2001. Special issue on Managing Text Natively and in DBMSs.
15. P. Weiner. Linear pattern matching algorithm. In Proc. 14th Symposium on Switching and Automata Theory, pages 1-11. IEEE Press, 1973.
16. S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83-91, 1992.