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











Base de dados
Intervalo de ano de publicação
1.
Sci Rep ; 5: 12051, 2015 Jul 10.
Artigo em Inglês | MEDLINE | ID: mdl-26159228

RESUMO

A previously described DNA sequence generator algorithm (DNA-SGA) using error-correcting codes has been employed as a computational tool to address the evolutionary pathway of the genetic code. The code-generated sequence alignment demonstrated that a residue mutation revealed by the code can be found in the same position in sequences of distantly related taxa. Furthermore, the code-generated sequences do not promote amino acid changes in the deviant genomes through codon reassignment. A Bayesian evolutionary analysis of both code-generated and homologous sequences of the Arabidopsis thaliana malate dehydrogenase gene indicates an approximately 1 MYA divergence time from the MDH code-generated sequence node to its paralogous sequences. The DNA-SGA helps to determine the plesiomorphic state of DNA sequences because a single nucleotide alteration often occurs in distantly related taxa and can be found in the alternative codon patterns of noncanonical genetic codes. As a consequence, the algorithm may reveal an earlier stage of the evolution of the standard code.


Assuntos
DNA/análise , Modelos Genéticos , Algoritmos , Arabidopsis/enzimologia , Arabidopsis/genética , Teorema de Bayes , Códon , DNA/química , Evolução Molecular , Malato Desidrogenase/classificação , Malato Desidrogenase/genética , Filogenia , Polimorfismo de Nucleotídeo Único
2.
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