Skip Navigation


Bioinformatics Advance Access originally published online on January 22, 2004
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/3/419    most recent
btg423v1
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 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 (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wood, M. J.
Right arrow Articles by Hirst, J. D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Wood, M. J.
Right arrow Articles by Hirst, J. D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(3) © Oxford University Press 2004; all rights reserved.

Applications Note

Predicting protein secondary structure by cascade-correlation neural networks

Matthew J. Wood and Jonathan D. Hirst *

School of Chemistry, University of Nottingham, University Park, Nottingham NG7 2RD, UK

Received on February 20, 2003 ; revised on June 20, 2003 ; accepted on August 9, 2003
Advance Access Publication January 22, 2004

Summary: The back-propagation neural network algorithm is a commonly used method for predicting the secondary structure of proteins. Whilst popular, this method can be slow to learn and here we compare it with an alternative: the cascade-correlation architecture. Using a constructive algorithm, cascade-correlation achieves predictive accuracies comparable to those obtained by back-propagation, in shorter time.

Availability: A web server is available to a trained cascade-correlation neural network, with links to the source code for both algorithms.

Contact: jonathan.hirst{at}nottingham.ac.uk

* 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?




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.