The quality of genetic code models in terms of their robustness against point mutations

DOI10.1007/s11538-019-00603-2zbMath1417.92103OpenAlexW2933546552WikidataQ92888275 ScholiaQ92888275MaRDI QIDQ2002108

Elena 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

zbMATH Keywords

genetic codepoint mutationsdichotomy classes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On dichotomic classes and bijections of the genetic code
• n -Nucleotide circular codes in graph theory
• Multi-way spectral partitioning and higher-order cheeger inequalities

This page was built for publication: The quality of genetic code models in terms of their robustness against point mutations