Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Pollastri, G.
Right arrow Articles by Baldi, P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pollastri, G.
Right arrow Articles by Baldi, P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 90001 2002
Pages S62-S70
© 2002 Oxford University Press

Prediction of contact maps by GIOHMMs and recurrent neural networks using lateral propagation from all four cardinal corners

G. Pollastri 1 and P. Baldi 2,*

1 Institute for Genomics and Bioinformatics, Department of Information and Computer Science, University of California, Irvine, Irvine, CA 92697-3425, USA
2 Department of Biological Chemistry, College of Medicine, University of California, Irvine, Irvine, CA 92697-3425, USA

Received on January 24, 2002 ; revised on March 31, 2002 ; accepted on March 31, 2002

Motivation: Accurate prediction of protein contact maps is an important step in computational structural proteomics. Because contact maps provide a translation and rotation invariant topological representation of a protein, they can be used as a fundamental intermediary step in protein structure prediction.

Results: We develop a new set of flexible machine learning architectures for the prediction of contact maps, as well as other information processing and pattern recognition tasks. The architectures can be viewed as recurrent neural network implemantations of a class of Bayesian networks we call generalized input-output HMMs (GIOHMMs). For the specific case of contact maps, contextual information is propagated laterally through four hidden planes, one for each cardinal corner. We show that these architectures can be trained from examples and yield contact map predictors that outperform previously reported methods. While several extensions and improvements are in progress, the current version can accurately predict 60.5% of contacts at a distance cutoff of 8 Å and 45% of distant contacts at 10 Å, for proteins of length up to 300.

Availability: The contact map predictor will be made available through http://promoter.ics.uci.edu/BRNN-PRED/ as part of an existing suite of proteomics predictors.

Contact: gpollast{at}ics.uci.edu pfbaldi{at}ics.uci.edu

Keywords: protein structure prediction; protein contacts, contact map; graphical models; recurrent neural networks.

* To whom correspondence should be addressed.


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
C. S. Miller and D. Eisenberg
Using inferred residue contacts to distinguish between correct and incorrect protein models
Bioinformatics, July 15, 2008; 24(14): 1575 - 1582.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
S. Wu and Y. Zhang
A comprehensive assessment of sequence-based and template-based methods for protein contact prediction
Bioinformatics, April 1, 2008; 24(7): 924 - 931.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A. Randall, J. Cheng, M. Sweredoski, and P. Baldi
TMBpro: secondary structure, {beta}-contact and tertiary structure prediction of transmembrane {beta}-barrel proteins
Bioinformatics, February 15, 2008; 24(4): 513 - 520.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Cheng and P. Baldi
A machine learning information retrieval approach to protein fold recognition
Bioinformatics, June 15, 2006; 22(12): 1456 - 1463.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
P. Larranaga, B. Calvo, R. Santana, C. Bielza, J. Galdiano, I. Inza, J. A. Lozano, R. Armananzas, G. Santafe, A. Perez, et al.
Machine learning in bioinformatics
Brief Bioinform, March 1, 2006; 7(1): 86 - 112.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
J. Cheng, A. Z. Randall, M. J. Sweredoski, and P. Baldi
SCRATCH: a protein structure and structural feature prediction server
Nucleic Acids Res., July 1, 2005; 33(suppl_2): W72 - W76.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. Punta and B. Rost
PROFcon: novel prediction of long-range contacts
Bioinformatics, July 1, 2005; 21(13): 2960 - 2968.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
I. Y. Y. Koh, V. A. Eyrich, M. A. Marti-Renom, D. Przybylski, M. S. Madhusudhan, N. Eswar, O. Grana, F. Pazos, A. Valencia, A. Sali, et al.
EVA: evaluation of protein structure prediction servers
Nucleic Acids Res., July 1, 2003; 31(13): 3311 - 3315.
[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.