Skip Navigation



Bioinformatics Advance Access published online on February 12, 2004
Bioinformatics, doi:10.1093/bioinformatics/bth036
Bioinformatics © Oxford University Press 2004; all rights reserved
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
20/7/1045    most recent
bth036v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Aung, Z.
Right arrow Articles by Tan, K.-L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Aung, Z.
Right arrow Articles by Tan, K.-L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Revised November 20, 2003
Accepted November 24, 2003

Article

Rapid 3D protein structure database searching using information retrieval techniques

Zeyar Aung 1* Kian-Lee Tan 1*

1 Department Computer Science, National University of Singapore, 3 Science Drive 2, Singapore 117543

* To whom correspondence should be addressed. E-mail: tankl{at}comp.nus.edu.sg.


  Abstract

Motivation: As the sizes of 3D protein structure databases are growing rapidly nowadays, exhaustive database searching, in which a 3D query structure is compared to each and every structure in the database, becomes inefficient. We propose a rapid 3D protein structure retrieval system named "ProtDex2", in which we adopt the techniques used in information retrieval (IR) systems in order to perform rapid database searching without having to access every 3D structure in the database. The retrieval process is based on the inverted-file index constructed on the feature vectors of the relationships between the secondary structure elements (SSEs) of all the 3D protein structures in the database. ProtDex2 is a significant improvement, both in terms of speed and accuracy, upon its predecessor system, ProtDex (Aung et al., 2003).

Results: The experimental results show that ProtDex2 is very much faster than two well-known protein structure comparison methods, DALI and CE, yet not sacrificing on the accuracy of the comparison. When comparing with a similar SSE-based method, namely TopScan, ProtDex2 is much faster with comparable degree of accuracy.

Availability: The software is available at: http://xena1.ddns.comp.nus.edu.sg/~genesis/PD2.htm

Supplementary Information: Supplementary tables and figures for this paper can also be found at: http://xena1.ddns.comp.nus.edu.sg/~genesis/PD2.htm


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
P.-H. Chi, B. Pang, D. Korkin, and C.-R. Shyu
Efficient SCOP-fold classification and retrieval using index-based protein substructure alignments
Bioinformatics, October 1, 2009; 25(19): 2559 - 2565.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
W.-C. Lo, C.-Y. Lee, C.-C. Lee, and P.-C. Lyu
iSARST: an integrated SARST web server for rapid protein structural similarity searches
Nucleic Acids Res., July 1, 2009; 37(suppl_2): W545 - W551.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
A. Sacan, I. H. Toroslu, and H. Ferhatosmanoglu
Integrated search and alignment of protein structures
Bioinformatics, December 15, 2008; 24(24): 2872 - 2879.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
J.-M. Yang and C.-H. Tung
Protein structure database search and evolutionary classification
Nucleic Acids Res., August 2, 2006; 34(13): 3646 - 3659.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.