Cargando…
Genetic codes optimized as a traveling salesman problem
The Standard Genetic Code (SGC) is robust to mutational errors such that frequently occurring mutations minimally alter the physio-chemistry of amino acids. The apparent correlation between the evolutionary distances among codons and the physio-chemical distances among their cognate amino acids sugg...
Autores principales: | Attie, Oliver, Sulkow, Brian, Di, Chong, Qiu, Weigang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6816573/ https://www.ncbi.nlm.nih.gov/pubmed/31658301 http://dx.doi.org/10.1371/journal.pone.0224552 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Hybrid pointer networks for traveling salesman problems optimization
por: Stohy, Ahmed, et al.
Publicado: (2021) -
Solving the Traveling Salesman's Problem Using the African Buffalo Optimization
por: Odili, Julius Beneoluchi, et al.
Publicado: (2016) -
The traveling salesman problem and its variations
por: Gutin, Gregory, et al.
Publicado: (2007) -
The multi-stripe travelling salesman problem
por: Çela, Eranda, et al.
Publicado: (2017)