Skip Navigation

Nucleic Acids Research 2004 32(Web Server Issue):W572-W575; doi:10.1093/nar/gkh436
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (883K) Freely available
Right arrow Alert me when this article is cited
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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Shyu, C.-R.
Right arrow Articles by Xu, D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Shyu, C.-R.
Right arrow Articles by Xu, D.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2004, the authors
Nucleic Acids Research, Vol. 32, Web Server issue © Oxford University Press 2004; all rights reserved

ProteinDBS: a real-time retrieval system for protein structure comparison

Chi-Ren Shyu*, Pin-Hao Chi, Grant Scott and Dong Xu1

Medical and Biological Digital Library Research Lab, 322 Engineering Building North and 1 Digital Biology Lab, 302 Engineering Building North, Department of Computer Science, University of Missouri, Columbia, MO 65211-2060, USA

* To whom correspondence should be addressed. Tel: +1 573 882 3842; Fax: +1 573 882 3813; Email: shyuc{at}missouri.edu
The authors wish it to be known that, in their opinion, all authors should be regarded as joint First Authors

Received February 15, 2004; Revised and Accepted April 15, 2004

We have developed a web server (ProteinDBS) for the life science community to search for similar protein tertiary structures in real time. This system applies computer visualization techniques to extract the predominant visual patterns encoded in two-dimensional distance matrices generated from the three-dimensional coordinates of protein chains. When meaningful contents, represented in a multi-dimensional feature space, have been extracted from distance matrices, an advanced indexing structure, Entropy Balanced Statistical (EBS) k-d tree, is utilized to index the data. Our system is able to return search results in ranked order from a database with 46 075 chains in seconds, exhibiting a reasonably high degree of precision. To our knowledge, this is the first real-time search engine for protein structure comparison. ProteinDBS provides two types of query method: query by Protein Data Bank protein chain ID and by new structures uploaded by users. The system is hosted at http://ProteinDBS.rnet.missouri.edu.


The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated.


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
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]


Home page
Nucleic Acids ResHome page
E. S. C. Shih, R.-c. R. Gan, and M.-J. Hwang
OPAAS: a web server for optimal, permuted, and other alternative alignments of protein structures.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W95 - W98.
[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.