Premium
Effective protein folding in simple random search
Author(s) -
Imoto Taiji
Publication year - 2001
Publication title -
biopolymers
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.556
H-Index - 125
eISSN - 1097-0282
pISSN - 0006-3525
DOI - 10.1002/1097-0282(200101)58:1<46::aid-bip50>3.0.co;2-q
Subject(s) - simple (philosophy) , folding (dsp implementation) , chemistry , protein folding , block (permutation group theory) , statistical physics , energy (signal processing) , biological system , algorithm , computer science , combinatorics , physics , mathematics , quantum mechanics , philosophy , biochemistry , epistemology , electrical engineering , biology , engineering
Here I show the following facts using a simple random search model without including any sophisticated energy term. As the size of elements exponentially affects the efficiency of folding, it can be remarkably enhanced by dividing the elements into small blocks. As the folding of the blocks is completely independent, the total folding time can be reduced to the folding time of the single hardest block. This result gives the simplest and most straightforward answer to the Levinthal paradox. © 2000 John Wiley & Sons, Inc. Biopoly 58: 46–49, 2001