A hash trie filter method for approximate string matching in genomic databases

Applied Intelligence

Volumn 33, Issue 1, 2010, Pages 21-38

  Chang, Ye In ^a   Chen, Jiun Rung ^a   Hsu, Min Tze ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Approximate string matching; Filter; Genomic database; Global order; Local order

Indexed keywords

APPROXIMATE STRING MATCHING; FILTER; GENOMIC DATABASE; GLOBAL ORDER; LOCAL ORDER;

DATABASE SYSTEMS; ERRORS;

GENES;

EID: 77956188072     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-010-0233-4     Document Type: Conference Paper

References (28)

1. SF Altschul W Gish W Miller EW Myers DJ Lipman 1990 Basic local alignment search tool J Mol Biol 215 3 403 410
2. R Baeza-Yates G Gonnet 1992 A new approach to text searching Commun ACM 35 10 74 82 10.1145/135239.135243
3. W Chang E Lawler 1994 Sublinear approximate string matching and biological applications Algorithmica 12 4 327 344 0942.68575 10.1007/BF01185431 1289486
4. Chang W, Marr T (1994) Approximate string matching and local similarity. In: 5th annual symposium on combinatorial pattern matching, pp 259-273
5. S Dobrišek J Žibert N Pavešić F Mihelič 2009 An edit-distance model for the approximate matching of timed strings IEEE Trans Pattern Anal Mach Intell 31 4 736 741 10.1109/TPAMI.2008.197
6. M Farach-Colton GM Landau SC Sahinalp D Tsur 2007 Identification of common molecular subsequences J Comput Syst Sci 73 7 1035 1044 1123.68119 10.1016/j.jcss.2007.03.007 2348328
7. Friedberg EC, Walker GC, Siede W (1995) DNA repair and mutagenesis. American Society Microbiology, America
8. Houle JL, Cadigan W, Henry S, Pinnamaneni A, Lundahl S (2000) Database Mining in the Human Genome Initiative. Available at: http://www.biodatabases. com/whitepaper01.html. Accessed 2 Sept. 2009
9. Hunt E, Atkinson MP, Irving RW (2001) A database index to large biological sequences. In: 27th conference on very large databases, pp 139-148
10. E Hunt MP Atkinson RW Irving 2002 Database indexing for large DNA and protein sequence collections VLDB J 10 1 256 271
11. Hyyro H, Pinzon Y, Shinohara A (2005) Fast bit-vector algorithms for approximate string matching under indel distance. In: 31st annual conference on current trends in theory and practice of informatics, pp 380-384
12. Karkkainen J, Na JC (2007) Faster filters for approximate string matching. In: Workshop on algorithm engineering and experiments, pp 1-7
13. Lee HP, Tsai YT, CY Tang (2004) A seriate coverage filtration approach for homology search. In: ACM symposium on applied computing, pp 180-184
14. DJ Lipman WR Pearson 1985 Rapid and sensitive protein similarity searches Science 227 4693 1435 1441 10.1126/science.2983426
15. B Ma J Tromp M Li 2002 PatternHunter: faster and more sensitive homology search Bioinformatics 18 3 440 445 10.1093/bioinformatics/18.3.440
16. A Mazeika MH Böhlen N Koudas D Srivastava 2007 Estimating the selectivity of approximate string queries ACM Trans Database Syst 32 2 1 40 10.1145/1242524.1242529
17. G Myers 1999 A fast bit-vector algorithm for approximate string matching based on dynamic programming J ACM 46 3 395 415 1065.68663 10.1145/316542.316550 1815739
18. Navarro G (1997) Multiple approximate string matching by counting. In: 4th south American workshop on string processing, pp 95-111
19. G Navarro 2001 A guided tour to approximate string matching ACM Comput Surv 33 1 31 88 10.1145/375360.375365
20. Navarro G, Sutinen E, Tanninen J, Tarhio J (2000) Indexing text with approximate q-grams. In: 11th annual symposium on combinatorial pattern matching, pp 350-363
21. TF Smith MS Waterman 1995 Identification of common molecular subsequences J Mol Biol 147 1 195 197 10.1016/0022-2836(81)90087-5
22. Sutinen E, Tarhio J (1995) On using q-gram locations in approximate string matching. In: 3th annual European symposium on algorithms, pp 327-340
23. Sutinen E, Tarhio J (1996) Filtration with q-samples in approximate string matching. In: 7th annual symposium on combinatorial pattern matching, pp 50-63
24. E Sutinen J Tarhio 2004 Approximate string matching with ordered q-grams Nord J Comput 11 4 321 343 1102.68725 2116410
25. Takaoka T (1994) Approximate pattern matching with samples. In: 5th international symposium on algorithms and computation, pp 234-242
26. E Ukkonen 1985 Finding approximate patterns in strings J Algorithms 6 1 132 137 0566.68072 10.1016/0196-6774(85)90023-9 780855
27. E Ukkonen 1992 Approximate string matching with q-grams and maximal matches Theor Comput Sci 92 1 191 211 0747.68026 10.1016/0304-3975(92)90143-4 1143139
28. HE Williams J Zobel 2002 Indexing and retrieval for genomic databases IEEE Trans Knowl Data Eng 14 1 63 78 10.1109/69.979973