
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jianjun Zhou, Jörg Sander, Zhipeng Cai, Lusheng Wang, Guohui Lin, "Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 4, pp. 669680, OctoberDecember, 2010.  
BibTex  x  
@article{ 10.1109/TCBB.2008.99, author = {Jianjun Zhou and Jörg Sander and Zhipeng Cai and Lusheng Wang and Guohui Lin}, title = {Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {7}, number = {4}, issn = {15455963}, year = {2010}, pages = {669680}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.99}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations IS  4 SN  15455963 SP669 EP680 EPD  669680 A1  Jianjun Zhou, A1  Jörg Sander, A1  Zhipeng Cai, A1  Lusheng Wang, A1  Guohui Lin, PY  2010 KW  Nearest neighbor search KW  metric space KW  triangle inequality pruning KW  virtual pivot KW  partial pivot KW  HIV1 computational genotyping. VL  7 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] S.F. Altschul, T.L. Madden, A.A. Schäffer, J. Zhang, Z. Zhang, W. Miller, and D.J. Lipman, "Gapped BLAST and PSIBLAST: A New Generation of Protein Database Search Programs," Nucleic Acids Research, vol. 25, pp. 33893402, 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. 24442448, 1988.
[3] B. Ma, J. Tromp, and M. Li, "PatternHunter: Faster and More Sensitive Homology Search," Bioinformatics, pp. 440445, 2002.
[4] G.R. Hjaltason and H. Samet, "IndexDriven Similarity Search in Metric Spaces," ACM Trans. Database Systems, vol. 28, pp. 517580, 2003.
[5] A. Guttman, "RTrees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD '84, pp. 4757, 1984.
[6] E. Chávez, G. Navarro, R.A. BaezaYates, and J.L. Marroquín, "Searching in Metric Spaces," ACM Computing Surveys, vol. 33, pp. 273321, 2001.
[7] S.A. Berrani, L. Amsaleg, and P. Gros, "Approximate Searches: $k$ Neighbors + Precision," Proc. Conf. Information and Knowledge Management (CIKM '03), pp. 2431, 2003.
[8] V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff, "QuerySensitive Embeddings," Proc. ACM SIGMOD '05, pp. 706717, 2005.
[9] M. Shapiro, "The Choice of Reference Points in BestMatch File Searching," Comm. ACM, vol. 20, pp. 339343, 1977.
[10] M.L. Mico, J. Oncina, and E. Vidal, "A New Version of the NearestNeighbour Approximating and Eliminating Search Algorithm (AESA) with Linear Preprocessing Time and Memory Requirements," Pattern Recognition Letters, vol. 15, pp. 917, 1994.
[11] R.F.S. Filho, A.J.M. Traina, C. Traina Jr., and C. Faloutsos, "Similarity Search without Tears: The OMNI Family of AllPurpose Access Methods," Proc. 17th Int'l Conf. Data Eng. (ICDE '01), pp. 623630, 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. 23572366, 2003.
[13] J.R. RicoJuan and L. Micó, "Comparison of AESA and LAESA Search Algorithms Using String and TreeEditDistances," Pattern Recognition Letters, vol. 24, pp. 14171426, 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. 831842, 2004.
[15] C. Traina Jr., R.F.S. Filho, A.J.M. Traina, M.R. Vieira, and C. Faloutsos, "The OmniFamily of AllPurpose Access Methods: A Simple and Effective Way to Make Similarity Search More Efficient," The VLDB J., vol. 16, pp. 483505, 2007.
[16] P. Ciaccia, M. Patella, and P. Zezula, "MTree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB '97), pp. 426435, 1997.
[17] G. Navarro, "Searching in Metric Spaces by Spatial Approximation," The VLDB J., vol. 11, pp. 2846, 2002.
[18] R. Weber, H.J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for SimilaritySearch Methods in HighDimensional Spaces," Proc. 24th Int'l Conf. Very Large Data Bases (VLDB '98), pp. 194205, 1998.
[19] H.V. Jagadish, B.C. Ooi, K.L. Tan, C. Yu, and R. Zhang, "iDistance: An Adaptive ${\rm b}^{+}$ Tree Based Indexing Method for Nearest Neighbor Search," ACM Trans. Database Systems, vol. 30, pp. 364397, 2005.
[20] J. Vleugels and R.C. Veltkamp, "Efficient Image Retrieval through Vantage Objects," Pattern Recognition, vol. 35, pp. 6980, 2002.
[21] X. Wu, Z. Cai, X.F. Wan, T. Hoang, R. Goebel, and G.H. Lin, "Nucleotide Composition String Selection in HIV1 Subtyping Using Whole Genomes," Bioinformatics, vol. 23, pp. 17441752, 2007.
[22] http://www.ncbi.nlm.nih.gov/genomesFLU/, 2008.
[23] Z. Zhang, S. Schwartz, L. Wagner, and W. Miller, "A Greedy Algorithm for Aligning DNA Sequences," J. Computational Biology, vol. 7, pp. 203214, 2000.
[24] J. Zhou and J. Sander, "Speedup Clustering with Hierarchical Ranking," Proc. Sixth IEEE Int'l Conf. Data Mining (ICDM '06), pp. 12051210, http://www.cs.ualberta.ca/TechReports/2008/ TR0809TR0809.pdf, 2006.
[25] P. Ciaccia, M. Patella, and P. Zezula, "A Cost Model for Similarity Queries in Metric Spaces," Proc. 17th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS '98), pp. 5968, 1998.