A fast algorithm for approximate pattern matching

Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science)

Volumn 40, Issue 6, 2012, Pages 103-108

  Li, Yong Jun ^a   Ao, Dao Gan ^a  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Approximate pattern matching; Dynamic programming algorithm; Matching time

Indexed keywords

APPROXIMATE PATTERN MATCHING; DYNAMIC PROGRAMMING ALGORITHM; FAST ALGORITHMS; FILTERING STRATEGIES; MATCHING TIME; PATTERN STRINGS; SUB-STRINGS; TEXT STRING; TIME COST;

DYNAMIC PROGRAMMING; PATTERN MATCHING;

ALGORITHMS;

EID: 84865381582     PISSN: 1000565X     EISSN: None     Source Type: Journal    
DOI: 10.3969/j.issn.1000-565X.2012.06.017     Document Type: Article

References (13)

1. Ukkonen E. Finding approximate patterns in strings [J]. Journal of Algorithms, 1985, 6(1/2/3): 132-137.
2. Wu S, Manber U. Fast text searching allowing errors[J]. Communications of the ACM, 1992, 35(10): 83-91.
3. Erkki Sutinen, Jorma Tarhio. On using q-gram locations in approximate string matching [R]. Finland: Lecture Notes in Computer Science, 1995.
4. Sun De-cai, Sun Xing-ming, Zhang Wei, et al. A filter algorithm for approximate string matching based on match-region features [J]. Journal of Computer Research and Development, 2010, 47(4): 663-670.
5. Ricardo Baeza-Yates, Gonzalo Navarro. Faster approximate string matching [J]. Algorithmica, 1999, 23(2): 127-158.
6. Li Chen, Wang Bin, Yang Xiaochun. VGRAM: Improving performance of approximate queries on string collections using variable-length grams [C]//VLDB '07 Proceedings of the 33rd International Conference on Very Large Data Bases. Vienna: VLDB Endowment, 2007.
7. Daniel Gayo-Avello, Dario Alvarez-Gutierrez, Jose Gayo-Avello. Application of variable length n-gram vectors to monolingual and bilingual information retrieval [C]//CLEF 2004. Bath: Spinger, 2004:73-82.
8. Thierry Lecroq. Fast exact string matching algorithms [J]. Information Processing Letters, 2007, 102(6): 229-235.
9. Gonzalo Navarro, Erkki Sutinen. Indexing text with approximate q-grams [J]. Journal of Discrete Algorithms, 2005, 3(2/3/4): 157-175.
10. Amir Seyed Danesh, Abdollatif Ahy. Compressing string data in a database by using q-grams [C]//2010 2nd International Conference on Computer Engineering and Technology (ICCET). Chengdu: IEEE, 2010: 362-366.
11. Han Jing-yu, Xu li-zhen, Dong Yi-sheng. An approach for detecting similar duplicate records of massive data [J]. Journal of Computer Research and Development, 2005, 42(12): 2206-2212.
12. Li Chen, Lu Jiaheng, Lu Yiming. Efficient merging and filtering algorithms for approximate string searches [C]//IEEE 24th International Conference on Data Engineering. Washington: IEEE, 2008: 257-266.
13. Kensuke Baba, Tetsuya Nakatoh, Yasuhiro Yamada, et al. A Preprocessing for approximate string matching [J]. Communications in Computer and Information Science, 2011, 252(5): 610-615