NDLI: Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations

Content Provider	ACM Digital Library
Author	Lin, Guohui Cai, Zhipeng Zhou, Jianjun Sander, Jorg Wang, Lusheng
Abstract	Modern biological applications usually involve the similarity comparison between two objects, which is often computationally very expensive, such as whole genome pairwise alignment and protein 3D structure alignment. Nevertheless, being able to quickly identify the closest neighboring objects from very large databases for a newly obtained sequence or structure can provide timely hints to its functions and more. This paper presents a substantial speedup technique for the well-studied k-nearest neighbor (k-nn) search, based on novel concepts of virtual pivots and partial pivots, such that a significant number of the expensive distance computations can be avoided. The new method is able to dynamically locate virtual pivots, according to the query, with increasing pruning ability. Using the same or less amount of database preprocessing effort, the new method outperformed the second best method by using no more than 40 percent distance computations per query, on a database of 10,000 gene sequences, compared to several best known k-nn search methods including M-Tree, OMNI, SA-Tree, and LAESA. We demonstrated the use of this method on two biological sequence data sets, one of which is for HIV-1 viral strain computational genotyping.
Starting Page	669
Ending Page	680
Page Count	12
File Format	PDF
ISSN	15455963
DOI	10.1109/TCBB.2008.99
Volume Number	7
Issue Number	4
Journal	IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-10-01
Access Restriction	Subscribed
Subject Keyword	Nearest neighbor search, metric space, triangle inequality pruning, virtual pivot, partial pivot, HIV-1 computational genotyping.
Content Type	Text
Resource Type	Article
Subject	Genetics Biotechnology Applied Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations

1 finding the nearest neighbors in biological databases using less distance computations (2008).

Keyword-based k-nearest neighbor search in spatial databases

Reverse Nearest Neighbor Search in Metric Spaces

Reverse Nearest Neighbor Search in Metric Spaces

K-Nearest Neighbor Finding Using MaxNearestDist

Finding Nearest Neighbors in Growth-restricted Metrics (2002)

The black-box complexity of nearest-neighbor search (2005)

Using the k-nearest neighbor graph for proximity searching in metric spaces (2005)

Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations

Similar Documents

Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations

1 finding the nearest neighbors in biological databases using less distance computations (2008).

Keyword-based k-nearest neighbor search in spatial databases

Reverse Nearest Neighbor Search in Metric Spaces

Reverse Nearest Neighbor Search in Metric Spaces

K-Nearest Neighbor Finding Using MaxNearestDist

Finding Nearest Neighbors in Growth-restricted Metrics (2002)

The black-box complexity of nearest-neighbor search (2005)

Using the k-nearest neighbor graph for proximity searching in metric spaces (2005)

Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations