A novel look-ahead optimization strategy for trie-based approximate string matching

Pattern Analysis and Applications

Volumn 9, Issue 2-3, 2006, Pages 177-187

  Badr, Ghada ^a   Oommen, B John ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Approximate string matching; Branch and bound techniques; Noisy syntactic recognition using tries; Pruning; Trie based syntactic pattern recognition

Indexed keywords

EID: 33749361273     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10044-006-0036-8     Document Type: Article

References (32)

1. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ (1990) A basic local alignment search tool. J Mol Biol 215:403-410
2. Baeza-Yates RA, Gonnet GH (1982) A new approach to text searching. In: Annual ACM-SIGIR conference on information retrieval, Cambridge, MA, June 1982, pp 168-175
3. Bentley J, Sedgewick R (1997) Fast algorithms for sorting and searching strings. In: Eighth annual ACM-SIAM symposium on discrete algorithms, New Orleans, January 1997, pp 360-369
4. Bucher P, Hoffmann K (1996) A sequence similarity search algorithm based on a probabilistic interpretation of an alignment scoring system. In: Proceedings of the fourth international conference on intelligent systems for molecular biology, ISMB, vol 96, pp 44-51
5. Bunke H (1993) Structural and syntactic pattern recognition. In: Chen CH, Pau LF, Wang PSP (eds) Handbook of pattern recognition and computer vision. World Scientific, Singapore
6. Bunke H, Csirik J (1993) Parametric string edit distance and its application to pattern recognition. IEEE Trans Syst Man Cybern SMC-25(1):202-206
7. Chang W, Lawler E (1992) Approximate string matching in sublinear expected time. In: 13th annual symposium on foundations of computer science, St.-Louis, Missouri, October 1992. IEEE Computer Society Press, pp 116-124
8. Clement J, Flajolet P, Vallee B (1998) The analysis of hybrid trie structures. In: Proceedings of the annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, pp 531-539
9. Crochemore M, Landau GM, Ziv-Ukleson M (1973) A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM J 32(6):1654-1673
10. Dewey G (1923) Relative frequency of English speech sounds. Harvard University Press, Cambridge, MA
11. Du M, Chang S (1994) An approach to designing very fast approximate string matching algorithms. IEEE Trans Knowledge Data Eng 6(4):620-633
12. Firebaugh M (1988) Artificial intelligence: a knowledge-based approach. Boyd and Fraser, Boston
13. Hirschberg DS (1975) A linear space algorithm for computing maximal common subsequence. Commun ACM 18(6):341-343
14. Hunt JW, Szymanski TG (1977) A fast algorithm for computing longest common subsequences. Commun Assoc Comput Mach 20:350-353
15. Kashyap RL, Oommen BJ (1981) An effective algorithm for string correction using generalized edit distances -I: description of the algorithm and its optimality. Inf Sci 23(2):123-142
16. Levenshtein A (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys Dokl 10:707-710
17. Masek WJ, Paterson MS (1980) A faster algorithm computing string edit distances. J Comput Syst Sci 20:18-31
18. Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31-88
19. Oflazer K (1996) Error-tolerant finite state recognition with applications to morphological analysis and spelling correction. Comput Linguist 22(1):73-89
20. Oommen BJ (1987) Recognition of noisy subsequences using constrained edit distances. IEEE Trans Pattern Anal Mach Intel PAMI 9:676-685
21. Oommen BJ, Badr G (2004) Dictionary-based syntactic pattern recognition using tries. In: Proceedings of the joint IARR international workshops SSPR 2004 and SPR 2004, Libon, August 2004
22. Oommen BJ, Kashyap RL (1998) A formal theory for optimal and information theoretic syntactic pattern recognition. Pattern Recognit 31:1159-1177
23. Oommen BJ, Loke RKS (1999) Designing syntactic pattern classifiers using vector quantization and parametric string editing. IEEE Trans Syst Man Cybern SMC-29:881-888
24. Oommen BJ, Loke RKS (2006) Syntactic pattern recognition involving traditional and generalized transposition errors: attaining the information theoretic bound (submitted)
25. Peterson JL (1980) Computer programs for detecting and correcting spelling errors. Commun Assoc Comput Mach 23:676-687
26. Sankoff D, Kruskal JB (1983) Time warps, string edits and macromolecules: the theory and practice of sequence comparison. Addison-Wesley, Reading, MA
27. Shang H, Merrettal T (1996) Tries for approximate string matching. IEEE Trans Knowledge Data Eng 8(4):540-547
28. Stephen GA (2000) String searching algorithms, Lecture notes series on computing, vol 6, World Scientific, Sihgapore, NJ
29. Ukkonen E (1985) Algorithm for approximate string matching. Inf control 64:100-118
30. Wagner RA (1974) Order-n correction for regular languages. Commun ACM 17:265-268
31. Wagner R, Fischer A (1974) The string-to-string correction problem. J Assoc Comput Machinery (ACM) 21:168-173
32. Wu S, Manber U (1992) Fast text searching allowing errors. Commmun ACM 35(10):83-91