.png){kind=icon}
.png){kind=icon}
Return
Improved greedy algorithm for protein structure reconstruction
.png){kind=icon}
PRE
AI
DOI：10.1002/jcc.20181.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
protein structure reconstruction
greedy algorithms
discrete conformation space
Go energy model
structural alphabet
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
7.1K
Citations:
6.1W
Organization
No organization information available