The structure of the genetic code as an optimal graph clustering problem

DOI10.1007/S00285-022-01778-4MaRDI QIDQ2161382zbMATH OpenOpenAlexWikidataFDO

Authors Dariusz R. Kowalski, Dorota Mackiewicz, Daniyah A. Aloqalaa, Paweł Mackiewicz, Paweł Błażej, Małgorzata Wnętrzak

Publication date 4 August 2022

Published in Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00285-022-01778-4

zbMATH Keywords

code degeneracygraph theoryset conductancestandard genetic code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Recommendations

• scientific article; zbMATH DE number 4008167
• Block structure and stability of the genetic code
• scientific article; zbMATH DE number 1867129
• scientific article; zbMATH DE number 821893
• Stability of the genetic code and optimal parameters of amino acids

Cites work

• Edge-isoperimetric problems for Cartesian powers of regular graphs
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Introduction to algorithms.
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.

Cited in

(5)

• The cyclic genetic code as a constraint satisfaction problem
• The quality of genetic code models in terms of their robustness against point mutations
• Block structure and stability of the genetic code
• scientific article; zbMATH DE number 1867129 (Why is no real title available?)
• RUNS OF AMINO ACIDS ARE LONGER THAN EXPECTED IN PROTEINS BASED ON A GRAPH THEORY REPRESENTATION OF THE GENETIC CODE

This page was built for publication: The structure of the genetic code as an optimal graph clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2161382)