A practical method for approximate subsequence search in DNA databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4426 LNAI, Issue , 2007, Pages 921-931

  Won, Jung Im ^a   Hong, Sang Kyoon ^b   Yoon, Jee Hee ^b   Park, Sanghyun ^c   Kim, Sang Wook ^a  

^a Hanyang University   (South Korea)

^b Hallym University   (South Korea)

^c Yonsei University   (South Korea)

Author keywords

Approximate subsequence search; DNA database; Suffix tree

Indexed keywords

APPROXIMATION THEORY; BINARY TREES; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; QUERY PROCESSING;

APPROXIMATE SUBSEQUENCE SEARCH; QUERY SEQUENCES; SUFFIX TREES;

DNA SEQUENCES;

EID: 38049171347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71701-0_103     Document Type: Conference Paper

References (13)

1. A. Califano and I. Rigoutso, "FLASH: A Fast Look-up Algorithm for String Homology", Proc. Intelligent System Conference for Morecular Biology, pp. 56-64, 1993.
2. C. Fondrat and P. Dessen, "A Rapid Access Motif database(RAMdb) with a search algorithm for the retrieval patterns in nucleic acids or proteun databanks", Computer Applications in the Biosciences, Vol. 11, No.3, pp. 273-279, 1995.
3. R. Giegerich, S. Kurtz, and J. Stoye, "Efficient Implementation of Lazy Suffix Trees", Softw. Pract. Exp., Vol 33, pp. 1035-1049, 2003.
4. D.Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
5. E. Hunt, M. P. Atkinson and R. W. Irving, "Database indexing for large DNA and protein sequence collections", VLDB Journal, Vol. 11, No. 3, pp. 256-271, 2002.
6. T. Kahveci and A. K. Singh, "An Efficient Index Structure for String Databases", Proc. VLDB Conference, pp. 351-360, 2001.
7. C. Meek, J. M. Patel, and S. Kasetty, "OASIS: An Online and Accurate Technique for Local-Alignment Searches on Biological sequences", Proc. VLDB Conference, pp. 920-921, 2003.
8. G. Navarro and R. Baeza-Yates, "A Hybrid Indexing Method for Approximate String Matching", Journal of Discrete ALgorithms, Vol. 1, No. 1, pp.205-239, 2000.
9. T. Smith and M. Waterman, "Identification of Common Molecular Subsequences", Journal of Molecular Biology 147, pp. 195-197, 1981.
10. S. Tata, R. Hankins, and J. Patel, "Practical Suffix Tree Construction", Proc. VLDB Conference, pp. 36-47, 2004.
11. H. Wang et al., "BLAST++: A Tool for BLASTing Queries in Batches", Proc. Asia-Pacific Bioinformatics Conference, pp. 71-79, 2003.
12. H. E. Williams and J. Zobel, "Indexing and Retrieval for Genomic Databases", IEEE TKDE, Vol. 14, No. 1. pp. 63-78, 2002.
13. J. I. Won, J. H. Yoon, S. H. Park and S. W. Kim, "A Novel Indexing Method for Efficient Sequence Matching in Large DNA Database Environment", Proc. PAKDD Conference, pp. 203-215, 2005.