The quality of genetic code models in terms of their robustness against point mutations
From MaRDI portal
Publication:2002108
DOI10.1007/S11538-019-00603-2zbMATH Open1417.92103OpenAlexW2933546552WikidataQ92888275 ScholiaQ92888275MaRDI QIDQ2002108FDOQ2002108
Authors: E. Fimmel, M. Gumbel, Paweł Błażej 
Publication date: 11 July 2019
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-019-00603-2
Recommendations
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Title not available (Why is that?)
- On dichotomic classes and bijections of the genetic code
- DNA, dichotomic classes and frame synchronization: a quasi-crystal framework
- Multi-way spectral partitioning and higher-order Cheeger inequalities
- \(n\)-nucleotide circular codes in graph theory
- Circular codes, symmetries and transformations
- Many alternative and theoretical genetic codes are more robust to amino acid replacements than the standard genetic code
- Study of the genetic code adaptability by means of a genetic algorithm
- The structure of the genetic code as an optimal graph clustering problem
- Strong comma-free codes in genetic information
Cited In (2)
This page was built for publication: The quality of genetic code models in terms of their robustness against point mutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002108)
