The look-ahead effect of phenotypic mutations

被引:54
|
作者
Whitehead, Dion J. [1 ]
Wilke, Claus O. [2 ,3 ]
Vernazobres, David [1 ]
Bornberg-Bauer, Erich [1 ]
机构
[1] Univ Munster, Inst Evolut & Biodivers, D-48149 Munster, Germany
[2] Univ Texas Austin, Ctr Computat Biol & Bioinformat, Sect Integrat Biol, Austin, TX 78712 USA
[3] Univ Texas Austin, Inst Cell & Mol Biol, Sect Integrat Biol, Austin, TX 78712 USA
基金
美国国家卫生研究院;
关键词
D O I
10.1186/1745-6150-3-18
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: The evolution of complex molecular traits such as disulphide bridges often requires multiple mutations. The intermediate steps in such evolutionary trajectories are likely to be selectively neutral or deleterious. Therefore, large populations and long times may be required to evolve such traits. Results: We propose that errors in transcription and translation may allow selection for the intermediate mutations, if the final trait provides a large enough selective advantage. We test this hypothesis using a population based model of protein evolution. Conclusion: If an individual acquires one of two mutations needed for a novel trait, the second mutation can be introduced into the phenotype due to transcription and translation errors. If the novel trait is advantageous enough, the allele with only one mutation will spread through the population, even though the gene sequence does not yet code for the complettrait. Thus, errors allow protein sequences to "look-ahead" for a more direct path to a complex trait. Reviewers: This article was reviewed by Eugene Koonin, Subhajyoti De (nomimated by Madan Babu), and David Krakauer.
引用
收藏
页数:15
相关论文
共 50 条
  • [31] Storage-to-tree transducers with look-ahead
    Hornung, T
    Vágvölgyi, S
    THEORETICAL COMPUTER SCIENCE, 2004, 329 (1-3) : 115 - 158
  • [32] Generalized look-ahead feedrate planning algorithm
    Dong, Jing-Chuan
    Wang, Tai-Yong
    Wang, Zi-Jing
    Li, Bo
    Ding, Yan-Yu
    Jiang, Yong-Xiang
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2013, 19 (03): : 529 - 539
  • [33] Distributed compilation allocation with look-ahead heuristics
    Mizrachi, D
    Exman, L
    2004 23RD IEEE CONVENTION OF ELECTRICAL AND ELECTRONICS ENGINEERS IN ISRAEL, PROCEEDINGS, 2004, : 141 - 144
  • [34] Look-ahead methods for block Hankel systems
    VanBarel, M
    Bultheel, A
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1997, 86 (01) : 311 - 333
  • [35] Scalable Look-Ahead Linear Regression Trees
    Vogel, David S.
    Asparouhov, Ognian
    Scheffer, Tobias
    KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2007, : 757 - +
  • [36] CSPS model: Look-ahead controls and physics
    Matsui, M
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2005, 43 (10) : 2001 - 2025
  • [37] Look-ahead techniques for fast beam search
    Ortmanns, S
    Eiden, A
    Ney, H
    Coenen, N
    1997 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I - V: VOL I: PLENARY, EXPERT SUMMARIES, SPECIAL, AUDIO, UNDERWATER ACOUSTICS, VLSI; VOL II: SPEECH PROCESSING; VOL III: SPEECH PROCESSING, DIGITAL SIGNAL PROCESSING; VOL IV: MULTIDIMENSIONAL SIGNAL PROCESSING, NEURAL NETWORKS - VOL V: STATISTICAL SIGNAL AND ARRAY PROCESSING, APPLICATIONS, 1997, : 1783 - 1786
  • [38] YEAR-END REVIEW - AND A LOOK-AHEAD
    NAPIER, DH
    AEROSPACE AMERICA, 1994, 32 (04) : 8 - 10
  • [39] On look-ahead heuristics in disjunctive logic programming
    Wolfgang Faber
    Nicola Leone
    Gerald Pfeifer
    Francesco Ricca
    Annals of Mathematics and Artificial Intelligence, 2007, 51 : 229 - 266
  • [40] Look-ahead versus look-back for satisfiability problems
    Li, CM
    Anbulagan
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 97, 1997, 1330 : 341 - 355