𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved greedy algorithm for protein structure reconstruction

✍ Scribed by Pierre Tuffery; Frédéric Guyon; Philippe Derreumaux

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
215 KB
Volume
26
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

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 Å RMSD using an RMSD‐based energy function and within 1.5 to 4.8 Å 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. © 2005 Wiley Periodicals, Inc. J Comput Chem 26: 506–513, 2005

📜 SIMILAR VOLUMES

Application of new systems techniques an
Application of new systems techniques and the greedy algorithm for reliability data reconstruction
✍ Hamid R. Jafari; Fouad N. Jalbout; Thomas F. Hassett 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 2 views

The main objective of this paper is to apply new systems techniques for condensing information that is contained in a reliability data set. These techniques, augmented with the Greedy Algorithm, were used to develop an algorithm for reduced data set reconstruction. The techniques go beyond tradition

Algorithm for rapid reconstruction of pr
Algorithm for rapid reconstruction of protein backbone from alpha carbon coordinates
✍ Milik, Mariusz; Kolinski, Andrzej; Skolnick, Jeffrey 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

A method for generating a full backbone protein structure from the coordinates of ␣-carbons, is presented. The method extracts information from known protein structures to generate statistical positions for the reconstructed atoms. Tests on a set of proteins structures show the algorithm to be of co

Improving the Wang–Landau algorithm for
Improving the Wang–Landau algorithm for polymers and proteins
✍ Adam D. Swetnam; Michael P. Allen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB

## Abstract The 1/__t__ Wang–Landau algorithm is tested on simple models of polymers and proteins. It is found that this method resolves the problem of the saturation of the error present in the original algorithm for lattice polymers. However, for lattice proteins, which have a rough energy landsc

Improvements to the distance geometry al
Improvements to the distance geometry algorithm for conformational sampling of cyclic structures
✍ Catherine E. Peishoff; J. Scott Dixon 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

Modifications to the distance geometry algorithm as embodied in the program DGEOM have been made to improve sampling capabilities. Specifically, torsion angle sampling replaces distance sampling for 1,4 atomic relationships and correlated distance sampling is disabled. The effects of these modificat