Finding the nearest neighbors in biological databases using less distance computations

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 7, Issue 4, 2010, Pages 669-680

  Zhou, Jianjun ^a   Sander, Jörg ^a   Cai, Zhipeng ^a   Wang, Lusheng ^b   Lin, Guohui ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

HIV 1 computational genotyping; HIV 1 computational genotyping.; metric space; Metric space; Nearest neighbor search; partial pivot; Partial pivot; triangle inequality pruning; Triangle inequality pruning; Virtual pivot; virtual pivot

Indexed keywords

GENOTYPING; METRIC SPACES; NEAREST NEIGHBOR SEARCH; PARTIAL PIVOT; TRIANGLE INEQUALITY; VIRTUAL PIVOT;

ALIGNMENT; DATABASE SYSTEMS; IMAGE RETRIEVAL; SET THEORY; TOPOLOGY;

TREES (MATHEMATICS);

HUMAN IMMUNODEFICIENCY VIRUS; HUMAN IMMUNODEFICIENCY VIRUS 1;

PROTEIN;

ARTICLE; BIOLOGY; CHEMISTRY; GENETIC DATABASE; METHODOLOGY; PROTEIN DATABASE; SEQUENCE ANALYSIS;

COMPUTATIONAL BIOLOGY; DATABASES, GENETIC; DATABASES, PROTEIN; PROTEINS; SEQUENCE ANALYSIS, PROTEIN;

EID: 78149283654     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2008.99     Document Type: Article

References (25)

1. S.F. Altschul, T.L. Madden, A.A. Schäffer, J. Zhang, Z. Zhang, W. Miller, and D.J. Lipman, "Gapped BLAST and PSI-BLAST: A New Generation of Protein Database Search Programs," Nucleic Acids Research, vol. 25, pp. 3389-3402, 1997.
2. W.R. Pearson and D.J. Lipman, "Improved Tools for Biological Sequence Comparison," Proc. Nat'l Academy of Sciences USA, vol. 85, pp. 2444-2448, 1988.
3. B. Ma, J. Tromp, and M. Li, "PatternHunter: Faster and More Sensitive Homology Search," Bioinformatics, pp. 440-445, 2002.
4. G.R. Hjaltason and H. Samet, "Index-Driven Similarity Search in Metric Spaces," ACM Trans. Database Systems, vol. 28, pp. 517-580, 2003.
5. A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD '84, pp. 47-57, 1984.
6. E. Chávez, G. Navarro, R.A. Baeza-Yates, and J.L. Marroquín, "Searching in Metric Spaces," ACM Computing Surveys, vol. 33, pp. 273-321, 2001.
7. S.-A. Berrani, L. Amsaleg, and P. Gros, "Approximate Searches: k-Neighbors + Precision," Proc. Conf. Information and Knowledge Management (CIKM '03), pp. 24-31, 2003.
8. V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff, "Query-Sensitive Embeddings," Proc. ACM SIGMOD '05, pp. 706-717, 2005.
9. M. Shapiro, "The Choice of Reference Points in Best-Match File Searching," Comm. ACM, vol. 20, pp. 339-343, 1977.
10. M.L. Mico, J. Oncina, and E. Vidal, "A New Version of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA) with Linear Preprocessing Time and Memory Requirements," Pattern Recognition Letters, vol. 15, pp. 9-17, 1994.
11. R.F.S. Filho, A.J.M. Traina, C. Traina Jr., and C. Faloutsos, "Similarity Search without Tears: The OMNI Family of All-Purpose Access Methods," Proc. 17th Int'l Conf. Data Eng. (ICDE '01), pp. 623-630, 2001.
12. B. Bustos, G. Navarro, and E. Chávez, "Pivot Selection Techniques for Proximity Searching in Metric Spaces," Pattern Recognition Letters, vol. 24, pp. 2357-2366, 2003.
13. J.R. Rico-Juan and L. Micó, "Comparison of AESA and LAESA Search Algorithms Using String and Tree-Edit-Distances," Pattern Recognition Letters, vol. 24, pp. 1417-1426, 2003.
14. C. Digout, M.A. Nascimento, and A. Coman, "Similarity Search and Dimensionality Reduction: Not All Dimensions are Equally Useful," Proc. Ninth Int'l Conf. Database Systems for Advances Applications (DASFAA '04), pp. 831-842, 2004.
15. C. Traina Jr., R.F.S. Filho, A.J.M. Traina, M.R. Vieira, and C. Faloutsos, "The Omni-Family of All-Purpose Access Methods: A Simple and Effective Way to Make Similarity Search More Efficient," The VLDB J., vol. 16, pp. 483-505, 2007.
16. P. Ciaccia, M. Patella, and P. Zezula, "M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB '97), pp. 426-435, 1997.
17. G. Navarro, "Searching in Metric Spaces by Spatial Approximation," The VLDB J., vol. 11, pp. 28-46, 2002.
18. R. Weber, H.-J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," Proc. 24th Int'l Conf. Very Large Data Bases (VLDB '98), pp. 194-205, 1998.
19. +-Tree Based Indexing Method for Nearest Neighbor Search," ACM Trans. Database Systems, vol. 30, pp. 364-397, 2005.
20. J. Vleugels and R.C. Veltkamp, "Efficient Image Retrieval through Vantage Objects," Pattern Recognition, vol. 35, pp. 69-80, 2002.
21. X. Wu, Z. Cai, X.-F. Wan, T. Hoang, R. Goebel, and G.-H. Lin, "Nucleotide Composition String Selection in HIV-1 Subtyping Using Whole Genomes," Bioinformatics, vol. 23, pp. 1744-1752, 2007.
22. http://www.ncbi.nlm.nih.gov/genomes/FLU/, 2008.
23. Z. Zhang, S. Schwartz, L. Wagner, and W. Miller, "A Greedy Algorithm for Aligning DNA Sequences," J. Computational Biology, vol. 7, pp. 203-214, 2000.
24. J. Zhou and J. Sander, "Speedup Clustering with Hierarchical Ranking," Proc. Sixth IEEE Int'l Conf. Data Mining (ICDM '06), pp. 1205-1210, http://www.cs.ualberta.ca/TechReports/2008/TR08-09/TR08-09.pdf, 2006.
25. P. Ciaccia, M. Patella, and P. Zezula, "A Cost Model for Similarity Queries in Metric Spaces," Proc. 17th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS '98), pp. 59-68, 1998.