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 条
  • [41] ALGORITHMIC AND COMPLEXITY ANALYSIS OF INTERPOLATION SEARCH
    GONNET, GH
    ROGERS, LD
    GEORGE, JA
    ACTA INFORMATICA, 1980, 13 (01) : 39 - 52
  • [42] The Algorithmic Complexity of the Paired Matching Problem
    Verhaegh, Ruben F. A.
    GRAPHS AND COMBINATORIAL OPTIMIZATION: FROM THEORY TO APPLICATIONS, CTW 2023, 2024, 13 : 1 - 13
  • [43] Algorithmic complexity of proper labeling problems
    Dehghan, Ali
    Sadeghi, Mohammad-Reza
    Ahadi, Arash
    THEORETICAL COMPUTER SCIENCE, 2013, 495 : 25 - 36
  • [44] Algorithmic Complexity of the Truck Factor Calculation
    Hannebauer, Christoph
    Gruhn, Volker
    PRODUCT-FOCUSED SOFTWARE PROCESS IMPROVEMENT, PROFES 2014, 2014, 8892 : 119 - 133
  • [45] Probability, algorithmic complexity, and subjective randomness
    Griffiths, TL
    Tenenbaum, JB
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL CONFERENCE OF THE COGNITIVE SCIENCE SOCIETY, PTS 1 AND 2, 2003, : 480 - 485
  • [46] Computational complexity, algorithmic scope, and evolution
    Sidl, Leonhard
    Faissner, Maximilian
    Uhlir, Manuel
    Velandia-Huerto, Cristian A.
    Waldl, Maria
    Yao, Hua-Ting
    Hofacker, Ivo L.
    Stadler, Peter F.
    JOURNAL OF PHYSICS-COMPLEXITY, 2025, 6 (01):
  • [47] Algorithmic complexity of shape grammar implementation
    Wortmann, Thomas
    Stouffs, Rudi
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 2018, 32 (02): : 138 - 146
  • [48] Optimal algorithmic complexity of fuzzy ART
    Burwick, T
    Joublin, F
    NEURAL PROCESSING LETTERS, 1998, 7 (01) : 37 - 41
  • [49] ALGORITHMIC COMPLEXITY OF LINEAR NONASSOCIATIVE ALGEBRA
    Kerimbaev, R. K.
    Dosmagulova, K. A.
    Zhunussova, Zh Kh
    JOURNAL OF MATHEMATICS MECHANICS AND COMPUTER SCIENCE, 2020, 107 (03): : 20 - 33
  • [50] THE COMPLEXITY AND REDUCIBILITY OF ALGORITHMIC MASS PROBLEMS
    KANOVICH, MI
    DOKLADY AKADEMII NAUK SSSR, 1983, 272 (02): : 289 - 293