Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
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 ISI Web of Science
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 Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Noguchi, T.
Right arrow Articles by Akiyama, Y.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Noguchi, T.
Right arrow Articles by Akiyama, Y.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 16 no. 6 2000
Pages 520-526
© 2000 Oxford University Press


Original Paper

Quick selection of representative protein chain sets based on customizable requirements

Tamotsu Noguchi 1,*, Kentaro Onizuka 1, Makoto Ando 1,3, Hideo Matsuda 2 and Yutaka Akiyama 1

1 Parallel Application TRC Laboratory, Real World Computing Partnership, Tsukuba Mitsui Building 1-6-1 Takezono, Tsukuba-shi Ibaraki 305-0032, Japan
2 Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama, Toyonaka-shi Osaka 560-8531, Japan

Received on October 22, 1999 ; accepted on February 3, 2000

Motivation: Protein structure classification has been recognized as one of the most important research issues in protein structure analysis. A substantial number of methods for the classification have been proposed, and several databases have been constructed using these methods. Since some proteins with very similar sequences may exhibit structural diversities, we have proposed PDB-REPRDB: a database of representative protein chains from the Protein Data Bank (PDB), which strategy of selection is based not only on sequence similarity but also on structural similarity. Forty-eight representative sets whose similarity criteria were predetermined were made available over the World Wide Web (WWW). However, the sets were insufficient in number to satisfy users researching protein structures by various methods.

Result: We have improved the system for PDB-REPRDB so that the user may obtain a quick selection of representative chains from PDB. The selection of representative chains can be dynamically configured according to the user’s requirement. The WWW interface provides a large degree of freedom in setting parameters, such as cut-off scores of sequence and structural similarity. This paper describes the method we use to classify chains and select the representatives in the system. We also describe the interface used to set the parameters.

Availability: The system for PDB-REPRDB is available at the PAPIA WWW server (http://www.rwcp.or.jp/papia/).

Contact: noguchi{at}trc.rwcp.or.jp

* To whom correspondence should be addressed.

3 Present address: Information Processing Systems Department, NKK Corporation, 1-1-2 Marunouchi, Chiyoda-ku, Tokyo 100-8202, Japan


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
T. Noguchi and Y. Akiyama
PDB-REPRDB: a database of representative protein chains from the Protein Data Bank (PDB) in 2003
Nucleic Acids Res., January 1, 2003; 31(1): 492 - 493.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
T. Noguchi, H. Matsuda, and Y. Akiyama
PDB-REPRDB: a database of representative protein chains from the Protein Data Bank (PDB)
Nucleic Acids Res., January 1, 2001; 29(1): 219 - 220.
[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.