1992
DOI: 10.1093/protein/5.4.313
|View full text |Cite
|
Sign up to set email alerts
|

Computational complexity of a problem in molecular structure prediction

Abstract: The computational task of protein-structure prediction is believed to require exponential time, but previous arguments as to its intractability have taken into account only the size of a protein's conformational space. Such arguments do not rule out the possible existence of an algorithm, more selective than exhaustive search, that is efficient and exact. (An efficient algorithm is one that is guaranteed, for all possible inputs, to run in time bounded by a function polynomial in the problem size. An intractab… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
43
0

Year Published

1997
1997
2002
2002

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 92 publications
(44 citation statements)
references
References 9 publications
1
43
0
Order By: Relevance
“…For very well designed proteins that can be made to stably fold well below T F but above T G , the asymptotic scaling of folding time is polynomial in chain length. There is no contradiction with well known NP completeness theorems (34) about predicting global minima of a random heteropolymer because well designed proteins are selected, minimally frustrated systems. If still above T G but near T F , the scaling for the time grows exponentially in size but the barrier rises sublinearly as N 2/3 in Finkelstein's (21) calculation.…”
mentioning
confidence: 99%
“…For very well designed proteins that can be made to stably fold well below T F but above T G , the asymptotic scaling of folding time is polynomial in chain length. There is no contradiction with well known NP completeness theorems (34) about predicting global minima of a random heteropolymer because well designed proteins are selected, minimally frustrated systems. If still above T G but near T F , the scaling for the time grows exponentially in size but the barrier rises sublinearly as N 2/3 in Finkelstein's (21) calculation.…”
mentioning
confidence: 99%
“…It is therefore desirable to determine the global minimum of the potential function without recourse to the folding dynamics. It has been argued that the resulting minimization problem is NP-hard [12][13][14], i.e. that the number of low-energy local minima grows exponentially with the number of amino acid residues.…”
mentioning
confidence: 99%
“…Moreover, a substantial number of these 8-mer chains would be so heavily dominated by one or other monomer type as to be implausible representations of natural proteins and unlikely to respond to the chaperone-based refolding method, relying as it does on the promotion of an energetically favorable segregation of hydrophobic and hydrophilic monomer types. It was pointed out in the work with the BLN 22-mers 38 that since the "protein folding problem" is in its most general form believed to be NPhard, 48,49 it would be unrealistic to expect any given minimization method to reliably locate nativelike structures for all instances of a heteropolymer model, and so it is reasonable in the present context to concentrate on developing a procedure that handles well those AB model chains that have a more proteinlike ratio of hydrophobic to hydrophilic monomers [real (globular) proteins when compared with the binary-state AB model may be observed to contain around 50 -60% "hydrophilic" residues, 50 the exact proportion depending on how the hydrophobic/hydrophilic residue assignment is made]. The subsets of the full 136-chain 8-mer set chosen here for initial development of the model (parameter optimization) are those with 3, 4, or 5 B-monomers, a total of 94 chains (Table Ia).…”
Section: Choice Of the Ab Model Data Setsmentioning
confidence: 99%