Skip Navigation

Bioinformatics 2005 21(Suppl 1):i75-i84; doi:10.1093/bioinformatics/bti1004
This Article
Right arrow FREE Full Text (Print PDF) Freely available
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 Cheng, J.
Right arrow Articles by Baldi, P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Cheng, J.
Right arrow Articles by Baldi, P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

Three-stage prediction of protein ß-sheets by neural networks, alignments and graph algorithms

Jianlin Cheng and Pierre Baldi *

Institute for Genomics and Bioinformatics, School of Information and Computer Sciences, University of California Irvine, CA 92697, USA

*To whom correspondence should be addressed.

Motivation: Protein ß-sheets play a fundamental role in protein structure, function, evolution and bioengineering. Accurate prediction and assembly of protein ß-sheets, however, remains challenging because protein ß-sheets require formation of hydrogen bonds between linearly distant residues. Previous approaches for predicting ß-sheet topological features, such as ß-strand alignments, in general have not exploited the global covariation and constraints characteristic of ß-sheet architectures.

Results: We propose a modular approach to the problem of predicting/assembling protein ß-sheets in a chain by integrating both local and global constraints in three steps. The first step uses recursive neural networks to predict pairing probabilities for all pairs of interstrand ß-residues from profile, secondary structure and solvent accessibility information. The second step applies dynamic programming techniques to these probabilities to derive binding pseudoenergies and optimal alignments between all pairs of ß-strands. Finally, the third step uses graph matching algorithms to predict the ß-sheet architecture of the protein by optimizing the global pseudoenergy while enforcing strong global ß-strand pairing constraints. The approach is evaluated using cross-validation methods on a large non-homologous dataset and yields significant improvements over previous methods.

Availability: http://www.igb.uci.edu/servers/psss.html

Contact: pfbaldi{at}ics.uci.edu


Received on January 15, 2005; accepted on March 27, 2005

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
Protein Eng Des SelHome page
H. Ashkenazy and Y. Kliger
Reducing phylogenetic bias in correlated mutation analysis
Protein Eng. Des. Sel., January 12, 2010; (2010) gzp078v1.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. Lippi and P. Frasconi
Prediction of protein {beta}-residue contacts by Markov logic networks with grounding-specific weights
Bioinformatics, September 15, 2009; 25(18): 2326 - 2333.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
A. N. Tegge, Z. Wang, J. Eickholt, and J. Cheng
NNcon: improved protein contact map prediction using 2D-recursive neural networks
Nucleic Acids Res., July 1, 2009; 37(suppl_2): W515 - W518.
[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
S. Hochreiter, M. Heusel, and K. Obermayer
Fast model-based protein homology detection without alignment
Bioinformatics, July 15, 2007; 23(14): 1728 - 1736.
[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]



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.