1996
DOI: 10.1002/pro.5560051010
|View full text |Cite
|
Sign up to set email alerts
|

A fast conformational search strategy for finding low energy structures of model proteins

Abstract: We describe a new computer algorithm for finding low-energy conformations of proteins. It is a chain-growth method that uses a heuristic bias function to help assemble a hydrophobic core. We call it the Core-directed chain Growth method (CG). We test the CG method on several well-known literature examples of HP lattice model proteins [in which proteins are modeled as sequences of hydrophobic (H) and polar (P) monomers], ranging from 20-64 monomers in two dimensions, and up to 88-mers in three dimensions. Previ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
86
0

Year Published

1999
1999
2010
2010

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 100 publications
(93 citation statements)
references
References 39 publications
(39 reference statements)
4
86
0
Order By: Relevance
“…Then, the 9th iteration is the measuring run which gives a very accurate estimate for the density of states covering about 25 orders of magnitude. Our estimate for the ground-state degeneracy is g 0 = 3.9 ± 0.4, which is in perfect agreement with the known value g ex 0 = 4 (except translational, rotational, and reflection symmetries) [17].…”
Section: A Lattice Model For Parallel β Helix With 42 Monomerssupporting
confidence: 90%
“…Then, the 9th iteration is the measuring run which gives a very accurate estimate for the density of states covering about 25 orders of magnitude. Our estimate for the ground-state degeneracy is g 0 = 3.9 ± 0.4, which is in perfect agreement with the known value g ex 0 = 4 (except translational, rotational, and reflection symmetries) [17].…”
Section: A Lattice Model For Parallel β Helix With 42 Monomerssupporting
confidence: 90%
“…11͒ and nPERMh ͑Ref. 12͒ ͑two Rosenbluth type chaingrowth-based methods͒, the core-guided ͑CG͒ search, 13 and ant colony optimization ͑ACO͒. 14 As shown in Table I, FRESS found the minimum energies for all ten sequences in less than 1 min on average.…”
Section: A Folding Hp Sequencesmentioning
confidence: 97%
“…Therefore, sophisticated algorithms were applied to find lowest energy states for chains of up to 136 monomers. The methods applied are based on very different algorithms, ranging from exact enumeration in two dimensions [9,10] and three dimensions on cuboid (compact) lattices [2,11], and hydrophobic core construction methods [12,13] over genetic algorithms [14,15,16,17,18], Monte Carlo simulations with different types of move sets [19,20,21,22], and generalized ensemble approaches [23] to Rosenbluth chain growth methods [24] of the 'Go with the Winners' type [25,26,27,28,29,30]. With some of these algorithms, thermodynamic quantities of lattice heteropolymers were studied as well [23,27,29,30,31].…”
Section: Introductionmentioning
confidence: 99%