code evolution
Recently Published Documents


TOTAL DOCUMENTS

65
(FIVE YEARS 12)

H-INDEX

14
(FIVE YEARS 2)

2021 ◽  
Author(s):  
BRIAN ROMERO ◽  
PETER VOROBIEFF ◽  
SVETLANA V. POROSEVA ◽  
JON M. REISNER

2021 ◽  
Vol 103 (5) ◽  
Author(s):  
John-Antonio Argyriadis ◽  
Yang-Hui He ◽  
Vishnu Jejjala ◽  
Djordje Minic
Keyword(s):  

Author(s):  
Devika Sondhi ◽  
Avyakt Gupta ◽  
Salil Purandare ◽  
Ankit Rana ◽  
Deepanshu Kaushal ◽  
...  
Keyword(s):  

Author(s):  
Michael Yarus

AbstractWobble coding is inevitable during evolution of the Standard Genetic Code (SGC). It ultimately splits half of NN U/C/A/G coding boxes with different assignments. Further, it contributes to pervasive SGC order by reinforcing close spacing for identical SGC assignments. But wobble cannot appear too soon, or it will inhibit encoding and more decisively, obstruct evolution of full coding tables. However, these prior results assumed Crick wobble, NN U/C and NN A/G, read by a single adaptor RNA. Superwobble translates NN U/C/A/G codons, using one adaptor RNA with an unmodified 5′ anticodon U (appropriate to earliest coding) in modern mitochondria, plastids, and mycoplasma. Assuming the SGC was selected when evolving codes most resembled it, characteristics of the critical selection events can be calculated. For example, continuous superwobble infrequently evolves SGC-like coding tables. So, continuous superwobble is a very improbable origin hypothesis. In contrast, late-arising superwobble shares late Crick wobble’s frequent resemblance to SGC order. Thus late superwobble is possible, but yields SGC-like assignments less frequently than late Crick wobble. Ancient coding ambiguity, most simply, arose from Crick wobble alone. This is consistent with SGC assignments to NAN codons.


2021 ◽  
pp. 30-43
Author(s):  
Bing Xia ◽  
Jianmin Pang ◽  
Jun Wang ◽  
Fudong Liu ◽  
Feng Yue

2019 ◽  
Author(s):  
John-Antonio Argyriadis ◽  
Yang-Hui He ◽  
Vishnu Jejjala ◽  
Djordje Minic

AbstractWe study the dynamics of genetic code evolution. The algorithm of Vetsigian et al. [1] provides a solution that is both optimal and universal. We reproduce and analyze the algorithm as a dynamical system. All the parameters used in the model are varied to assess their impact on achieving universality. We show that by allowing specific parameters to vary with time, the algorithm converges much faster to a universal solution. Finally, we study automorphisms of the genetic code arising due to this model. We use this to examine the scaling of the solutions in order to understand the origin of universality and find that there is a direct link to mutation rate.


2019 ◽  
Vol 453 (1) ◽  
pp. 19-33 ◽  
Author(s):  
Hugo J. Parker ◽  
Marianne E. Bronner ◽  
Robb Krumlauf

Sign in / Sign up

Export Citation Format

Share Document