Reference-Based Indexing of Sequence Databases

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 906-917

  Venkateswaran, Jayendra ^a   Lachwani, Deepak ^a   Kahveci, Tamer ^a   Jermaine, Christopher ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION); QUERY PROCESSING;

DISTANCE COMPUTATION; EDIT DISTANCE; FREQUENCY VECTOR; LARGE SEQUENCES; LONG SEQUENCES; MAIN-MEMORY; NOVEL STRATEGIES; SEQUENCE DATABASE; SIMILARITY MEASURE; SIMILARITY SEARCH;

DATABASE SYSTEMS;

EID: 84939567221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. S. Altschul, W. Gish, W. Miller, E. W. Meyers, and D. J. Lipman. Basic Local Alignment Search Tool. Journal of Molecular Biology, 215(3):403–410, 1990.
2. R.A. Baeza-Yates and C.H. Perleberg. Fast and practical approximate string matching. In CPM, pages 185–192, 1992.
3. Ricardo A. Baeza-Yates and Gonzalo Navarro. Faster Approximate String Matching. Algorithmica, 23(2):127–158, 1999.
4. A. Bairoch, B. Boeckmann, S. Ferro, and E. Gasteiger. Swiss-Prot: juggling between evolution and stability. Briefings in Bioinformatics, 1:39–55, 2004.
5. D.A. Benson, I. Karsch-Mizrachi, D.J. Lipman, J. Ostell, B.A. Rapp, and D.L. Wheeler. GenBank. Nucleic Acids Research, 28(1):15–18, January 2000.
6. Tolga Bozkaya and Meral Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In ACM SIGMOD, pages 357–368, 1997.
7. Xia Cao, Beng Chin Ooi, HweeHwa Pang, Kian-Lee Tan, and Anthony K. H. Tung. Dsim: A distance-based indexing method for genomic sequences. In BIBE, pages 97–104, 2005.
8. Paolo Ciaccia, Marco Patella, and Pavel Zezula. M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces. In The VLDB Journal, pages 426–435, 1997.
9. A.L. Delcher, S. Kasif, R.D. Fleischmann, J. Peterson, O. Whited, and D.L. Salzberg. Alignment of Whole Genomes. Nucleic Acids Research, 27(11):2369–2376, 1999.
10. P. Ferragina and R. Grossi. The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. JACM, 46(2):236–280, 1999.
11. Roberto F. Santos Filho, Agma J. M. Traina, Caetano Traina, and Christos Faloutsos. Similarity Search without Tears: The OMNI Family of All-purpose Access Methods. In ICDE, pages 623–630, 2001.
12. E. Giladi, M.G. Walker, J.Z. Wang, and W. Volkmuth. SST: An Algorithm for Finding Near-Exact Sequence Matches in Time Proportional to the Logarithm of the Database Size. Bioinformatics, 18(6):873–877, 2002.
13. L. Gravano, P.G. Ipeirotis, H.V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, pages 491–500, 2001.
14. Emil Julius Gumbel. Statistics of Extremes. Columbia University Press, New York, NY, USA, 1958.
15. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1 edition, January 1997.
16. E. Hunt, M. P. Atkinson, and R. W. Irving. A Database Index to Large Biological Sequences. In VLDB, pages 139–148, Rome, Italy, September 2001.
17. H. V. Jagadish, Beng Chin Ooi, Kian-Lee Tan, Cui Yu, and Rui Zhang. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst., 30(2):364–397, 2005.
18. T. Kahveci, V. Ljosa, and A.K. Singh. Speeding up whole-genome alignment by indexing frequency vectors. Bioinformatics, 2004. to appear.
19. T. Kahveci and A. Singh. An Efficient Index Structure for String Databases. In VLDB, pages 351–360, Rome,Italy, September 2001.
20. J. Kärkkäinen. Suffix Cactus: A Cross between Suffix Tree and Suffix Array. In CPM, 1995.
21. U. Manber and E. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935–948, 1993.
22. E.M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. JACM, 23(2):262–272, 1976.
23. C. Meek, J. M. Patel, and S. Kasetty. OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences. In VLDB, 2003.
24. Eugene W. Myers. An o(ND) difference algorithm and its variations. Algorithmica, 1(2):251–266, 1986.
25. G. Navarro and R. Baeza-Yates. A Hybrid Indexing Method for Approximate String Matching. J. Discret. Algorithms, 1(1):205–239, 2000.
26. S. B. Needleman and C. D. Wunsch. A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins. JMB, 48:443–53, 1970.
27. W.R. Pearson and D.J. Lipman. Improved Tools for Biological Sequence Comparison. PNAS, 85:2444–2448, April 1988.
28. S.C. Sahinalp, M. Taşan, J. Macker, and Z.M. Özsoyoğlu. Distance Based Indexing for String Proximity Search. In ICDE, 2003.
29. Caetano Traina, Agma J. M. Traina, Roberto F. Santos Filho, and Christos Faloutsos. How to improve the pruning ability of dynamic metric access methods. In CIKM, pages 219–226, 2002.
30. Caetano Traina, Agma J. M. Traina, Bernhard Seeger, and Christos Faloutsos. Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes. In EDBT, pages 51–65, 2000.
31. E. Ukkonen. Algorithms for Approximate String Matching. Information and Control, 64:100–118, 1985.
32. E. Ukkonen. On-line Construction of Suffix-trees. Algorithmica, 14:249–260, 1995.
33. Marcos R. Vieira, Caetano Traina, Fabio Jun Takada Chino, and Agma J. M. Traina. DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data. In SBBD, pages 163–177, 2004.
34. Jules Vleugels and Remco Veltkamp. Efficient image retrieval through vantage objects. In VISUAL, pages 575–584. Springer, 1999.
35. P. Weiner. Linear Pattern Matching Algorithms. In IEEE Symposium on Switching and Automata Theory, pages 1–11, 1973.
36. P.N. Yianilos. Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. In SODA, pages 311–321, 1993.