Title
Improved greedy algorithm for protein structure reconstruction.
Abstract
This article concerns the development of an improved greedy algorithm for protein structure reconstruction. Our stochastic greedy algorithm, which attempts to locate the ground state of an approximate energy function, exploits the fact that protein structures consist of overlapping structural building blocks that are not independent. Application of this approach to a series of 16 proteins with 50-250 amino acids leads to predicted models deviating from the experimental structures by 0.5 angstrom RMSD using an RMSD-based energy function and within 1.5 to 4.8 angstrom RMSD using a Go-based energy function. The Go-based results are significant because they illustrate the strength of combining structural fragments and stochastic greedy algorithms in capturing the native structures of proteins stabilized by long-range interactions separated by more than 30 amino acids. These results clearly open the door to less computationally demanding solutions to predict structures from sequences. (c) 2005 Wiley Periodicals, Inc. J Comput Chem 26: 506-513, 2005.
Year
DOI
Venue
2005
10.1002/jcc.20181
JOURNAL OF COMPUTATIONAL CHEMISTRY
Keywords
Field
DocType
protein structure reconstruction,greedy algorithms,discrete conformation space,Go energy model,structural alphabet
Mathematical optimization,Ground state,Greedy algorithm,Mathematics,Protein structure
Journal
Volume
Issue
ISSN
26
5
0192-8651
Citations 
PageRank 
References 
8
1.02
3
Authors
3
Name
Order
Citations
PageRank
Pierre Tufféry145642.46
Frédéric Guyon210114.55
Philippe Derreumaux37014.13