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


Autoria(s): Faria, Luzinete C. B.; Rocha, Andrea S. L.; Kleinschmidt, Joao H.; Silva-Filho, Marcio C.; Bim, Edson; Herai, Roberto H.; Yamagishi, Michel E. B.; Palazzo, Reginaldo, Jr.
Contribuinte(s)

UNIVERSIDADE DE SÃO PAULO

Data(s)

04/11/2013

04/11/2013

2012

Resumo

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.

Brazilian agencies FAPESP

Brazilian agencies FAPESP

CNPq

CNPq

CAPES

CAPES

Identificador

PLOS ONE, SAN FRANCISCO, v. 7, n. 5, supl. 1, Part 2, pp. 5702-5722, MAY 23, 2012

1932-6203

http://www.producao.usp.br/handle/BDPI/37967

10.1371/journal.pone.0036644

http://dx.doi.org/10.1371/journal.pone.0036644

Idioma(s)

eng

Publicador

PUBLIC LIBRARY SCIENCE

SAN FRANCISCO

Relação

PLOS ONE

Direitos

openAccess

Copyright PUBLIC LIBRARY SCIENCE

Palavras-Chave #BCH CODES #DNA #SEQUENCES #RINGS #MULTIDISCIPLINARY SCIENCES
Tipo

article

original article

publishedVersion