Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 1 de 1
Filtrar
Mais filtros











Base de dados
Intervalo de ano de publicação
1.
PLoS One ; 7(5): e36644, 2012.
Artigo em Inglês | MEDLINE | ID: mdl-22649495

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.


Assuntos
Algoritmos , Sequência de Bases/genética , Reparo do DNA/genética , Genoma/genética , Modelos Genéticos , Lactococcus lactis/genética
SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA