Cargando…

Is a Genome a Codeword of an Error-Correcting Code?

Since a genome is a discrete sequence, the elements of which belong to a set of four letters, the question as to whether or not there is an error-correcting code underlying DNA sequences is unavoidable. The most common approach to answering this question is to propose a methodology to verify the exi...

Descripción completa

Detalles Bibliográficos
Autores principales: Faria, Luzinete C. B., Rocha, Andréa S. L., Kleinschmidt, João H., Silva-Filho, Márcio C., Bim, Edson, Herai, Roberto H., Yamagishi, Michel E. B., Palazzo, Reginaldo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2012
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3359345/
https://www.ncbi.nlm.nih.gov/pubmed/22649495
http://dx.doi.org/10.1371/journal.pone.0036644
Descripción
Sumario:Since a genome is a discrete sequence, the elements of which belong to a set of four letters, the question as to whether or not there is an error-correcting code underlying DNA sequences is unavoidable. The most common approach to answering this question is to propose a methodology to verify the existence of such a code. However, none of the methodologies proposed so far, although quite clever, has achieved that goal. In a recent work, we showed that DNA sequences can be identified as codewords in a class of cyclic error-correcting codes known as Hamming codes. In this paper, we show that a complete intron-exon gene, and even a plasmid genome, can be identified as a Hamming code codeword as well. Although this does not constitute a definitive proof that there is an error-correcting code underlying DNA sequences, it is the first evidence in this direction.