A filter algorithm for approximate string matching based on match-region features

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 47, Issue 4, 2010, Pages 663-670

  Sun, Decai ^a   Sun, Xingming ^a   Zhang, Wei ^a   Liu, Yuling ^a  

^a HUNAN UNIVERSITY   (China)

Author keywords

Approximate string matching; Filter algorithm; Filtration efficiency; Match region feature; Q gram

Indexed keywords

APPROXIMATE STRING MATCHING; EDIT DISTANCE; ERROR RATE; FILTER ALGORITHM; FILTRATION EFFICIENCY; FIXED SIZE; IMPROVED METHODS; MATCHING SPEED; PREPROCESS; Q-GRAM INDICES; REGION FEATURE; REGION-BASED; TEXT-SEARCHING;

SPEED;

ALGORITHMS;

EID: 77952604928     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Zou Xukai. An efficient approach to computing char/Chinese character strings's edit distances and edit paths[J]. Journal of Computer Research and Development, 1996, 33(8): 574-580 (in Chinese)
2. Burkhardt S. Filter algorithms for approximate string matching[D]. Saarbrucken, Saarland, Germany: Department of Computer Science, Saarland University, 2002
3. Navarro G. A guided tour to approximate string matching[J]. ACM Computing Surveys, 2001, 33(1): 31-88
4. Wu Sun, Manber U, Myers G. A sub-quadratic algorithm for approximate limited expression matching[J]. Algorithmica, 1996, 15(1): 50-67
5. Baeza-Yates R, Navarro G. A faster algorithm for approximate string matching[C] //Proc of the 7th Annual Symp on Combinatorial Pattern Matching. Berlin: Springer, 1996: 1-23
6. Navarro G, Baeza-Yates R, Sutinen E, et al. Indexing methods for approximate string matching[J]. IEEE Data Engineering Bulletin, 2001, 24(4): 19-27
7. Tian Yuanyuan, Tata S, Hankins R A, et al. Practical methods for constructing suffix trees[J]. VLDB Journal, 2005, 14(3): 281-299
8. Gonnet G, Baeza-Yates R, Snider T. Information Retrieval: Data Structures and Algorithms[M]. Upper Saddle River, New Jersey: Prentice Hall, 1992
9. Lok-Lam C, Cheung D W, Siu-Ming Y. Approximate string matching in DNA sequences[C] //Proc of the 8th Int Conf on Database Systems for Advanced Applications. Piscataway, NJ: IEEE, 2003: 303-310
10. Navarro G, Baeza-Yates R. A practical q-gram index for text retrieval allowing errors[J/OL]. CLEI Electronic Journal, 1998, 1(2): 1-16. http://www.clei.cl/cleiej/papers/vli2p3.ps.gz
11. Navarro G, Sutinen E, Tarhio J. Indexing text with approximate q-grams[J]. Journal of Discrete Algorithms, 2005, 3(2/3/4): 157-175
12. Sutinen E, Tarhio J. Filtration with q-samples in approximate string matching[C] //Proc of the 7th Annual Symp on Combinatorial Pattern Matching. Berlin: Springer, 1996: 50-63
13. Jokinen P, Ukkonen E. Two algorithms for approximate string matching in static texts[C] //Proc of the 16th Symp on Mathematical Foundations of Computer Science. Berlin: Springer, 1991: 240-248
14. Ukkonen E. Approximate string-matching with q-grams and maximal matches[J]. Theoretical Computer Science, 1992, 92(1): 191-211
15. Burkhardt S, Crauser A, Ferragina P, et al. q-gram based database searching using a suffix array[C] //Proc of the Annual Int Conf on Computational Molecular Biology. New York: ACM, 1999: 77-83
16. Rasmussen K R, Stoye J, Myers E W. Efficient q-gram filters for finding all ε-matches over a given length[C] //Proc of the 9th Annual Int Conf on Computational Molecular Biology. Berlin: Springer, 2005: 189-203
17. Pearson W R, Lipman D J. Improved tools for biological sequence comparison[J]. Proceedings of the National Academy of Sciences, 1988, 85(8): 2444-2448
18. Ning Zemin, Anthony J C, James C M. SSAHA: A fast search method for large DNA databases[J]. Genome Research, 2001, 11(10): 1725-1729
19. Cao Xia, Li Shuaicheng, Tung A K H. Indexing DNA sequences using q-grams[C] //Proc of the 10th Int Conf DASFAA 2005. Berlin: Springer, 2005: 4-16
20. Nie Jianyun, Gao Jiangfeng, Zhang Jian, et al. On the use of words and n-grams for Chinese information retrieval[C] //Proc of the 5th Int Workshop on Information Retrieval with Asian Languages. New York: ACM, 2000: 141-148
21. Myers G. A fast bit-vector algorithm for approximate string matching based on dynamic programming[J]. Journal of the ACM, 1999, 46(3): 395-415
22. NCBI. GenBank: NCBI-GenBank Flat File Release 167.0, Expressed sequence tags[DB/OL]. (2008-08-15) [2008-10-03]. http://www.ncbi.nlm.nih.gov/
23. Sutinen E, Szpankowski W. On the collapse of the q-gram filtration[C] //Proc of Int Conf FUN with Algorithms. Waterloo, Canada: Carleton Scientific, 1998: 178-193