Algorithmic complexity of a protein

被引:19
|
作者
Dewey, TG
机构
[1] Department of Chemistry, University of Denver, Denver, CO
来源
PHYSICAL REVIEW E | 1996年 / 54卷 / 01期
关键词
D O I
10.1103/PhysRevE.54.R39
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
The information contained in a protein's amino acid sequence dictates its three-dimensional structure. To quantitate the transfer of information that occurs in the protein folding process, the Kolmogorov information entropy or algorithmic complexity of the protein structure is investigated. The algorithmic complexity of an object provides a means of quantitating its information content. Recent results have indicated that the algorithmic complexity of microstates of certain statistical mechanical systems can be estimated from the thermodynamic entropy. In the present work, it is shown that the algorithmic complexity of a protein is given by its configurational entropy. Using this result, a quantitative estimate of the information content of a protein's structure is made and is compared to the information content of the sequence. Additionally, the mutual information between sequence and structure is determined. It is seen that virtually all the information contained in the protein structure is shared with the sequence.
引用
收藏
页码:R39 / R41
页数:3
相关论文
共 50 条
  • [31] Algorithmic complexity and efficiency of a ratchet
    Depto. de Física, Fac. Ing., Univ. Nac. Mar Plata, A., Plata, Argentina
    不详
    Phys A Stat Mech Appl, 2 (285-292):
  • [32] Algorithmic complexity of quantum capacity
    Oskouei, Samad Khabbazi
    Mancini, Stefano
    QUANTUM INFORMATION PROCESSING, 2018, 17 (04)
  • [33] On the algorithmic complexity of static structures
    Joel Ratsaby
    J. Chaskalovic
    Journal of Systems Science and Complexity, 2010, 23 : 1037 - 1053
  • [34] ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES
    Ratsaby, Joel
    Chaskalovic, J.
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2010, 23 (06) : 1037 - 1053
  • [35] ALGORITHMIC COMPLEXITY OF DISCRETE FUNCTIONS
    OFMAN, Y
    DOKLADY AKADEMII NAUK SSSR, 1962, 145 (01): : 48 - &
  • [36] On the Improbability of Algorithmic Specified Complexity
    Ewert, Winston
    Marks, Robert J., II
    Dembski, William A.
    45TH SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY, 2013, : 68 - 70
  • [37] ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS
    ALDER, A
    STRASSEN, V
    THEORETICAL COMPUTER SCIENCE, 1981, 15 (02) : 201 - 211
  • [38] Algorithmic complexity as a criterion of unsolvability
    Burgin, Mark
    THEORETICAL COMPUTER SCIENCE, 2007, 383 (2-3) : 244 - 259
  • [39] On the algorithmic complexity of edge total domination
    Zhao, Yancai
    Liao, Zuhua
    Miao, Lianying
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 28 - 33
  • [40] Algorithmic complexity of thermal ratchet motion
    Sanchez, JR
    Family, F
    Arizmendi, CM
    PHYSICS LETTERS A, 1998, 249 (04) : 281 - 285