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 条
  • [1] Algorithmic complexity of protein structure alignment
    Dewey, G
    Jia, YT
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2005, 229 : U796 - U796
  • [2] Algorithmic complexity of protein identification:: combinatorics of weighted strings
    Cieliebak, M
    Erlebach, T
    Lipták, Z
    Stoye, J
    Welzl, E
    DISCRETE APPLIED MATHEMATICS, 2004, 137 (01) : 27 - 46
  • [3] Algorithmic complexity of protein identification:: Searching in weighted strings
    Cieliebak, M
    Lipták, Z
    Welzl, E
    Erlebach, T
    Stoye, J
    FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 143 - 156
  • [4] Algorithmic complexity and randomness
    Partovi, AH
    BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, PT 2, 2001, 568 : 31 - 37
  • [5] Algorithmic complexity and applications
    Calude, Cristian S.
    Jurgensen, Helmut
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : VII - VIII
  • [6] Algorithmic Folding Complexity
    Jean Cardinal
    Erik D. Demaine
    Martin L. Demaine
    Shinji Imahori
    Tsuyoshi Ito
    Masashi Kiyomi
    Stefan Langerman
    Ryuhei Uehara
    Takeaki Uno
    Graphs and Combinatorics, 2011, 27 : 341 - 351
  • [7] The Algorithmic Complexity of Landscapes
    Papadimitriou, Fivos
    LANDSCAPE RESEARCH, 2012, 37 (05) : 591 - 611
  • [8] The history of Algorithmic complexity
    Nasar, Audrey A.
    MATHEMATICS ENTHUSIAST, 2016, 13 (03): : 217 - 242
  • [9] Chaos and algorithmic complexity
    Batterman, RW
    White, H
    FOUNDATIONS OF PHYSICS, 1996, 26 (03) : 307 - 336
  • [10] On the algorithmic complexity of crystals
    Krivovichev, S. V.
    MINERALOGICAL MAGAZINE, 2014, 78 (02) : 415 - 435