Your browser doesn't support javascript.
loading
Phylogenetic information complexity: is testing a tree easier than finding it?
Steel, Mike; Székely, Laszlo; Mossel, Elchanan.
Afiliação
  • Steel M; Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand. m.steel@math.canterbury.ac.nz
J Theor Biol ; 258(1): 95-102, 2009 May 07.
Article em En | MEDLINE | ID: mdl-19490881
ABSTRACT
Phylogenetic trees describe the evolutionary history of a group of present-day species from a common ancestor. These trees are typically reconstructed from aligned DNA sequence data. In this paper we analytically address the following question Is the amount of sequence data required to accurately reconstruct a tree significantly more than the amount required to test whether or not a candidate tree was the 'true' tree? By 'significantly', we mean that the two quantities do not behave the same way as a function of the number of species being considered. We prove that, for a certain type of model, the amount of information required is not significantly different; while for another type of model, the information required to test a tree is independent of the number of leaves, while that required to reconstruct it grows with this number. Our results combine probabilistic and combinatorial arguments.
Assuntos

Texto completo: 1 Base de dados: MEDLINE Assunto principal: Filogenia / Algoritmos / Simulação por Computador / Evolução Biológica / Modelos Genéticos Tipo de estudo: Diagnostic_studies / Prognostic_studies Limite: Animals Idioma: En Ano de publicação: 2009 Tipo de documento: Article

Texto completo: 1 Base de dados: MEDLINE Assunto principal: Filogenia / Algoritmos / Simulação por Computador / Evolução Biológica / Modelos Genéticos Tipo de estudo: Diagnostic_studies / Prognostic_studies Limite: Animals Idioma: En Ano de publicação: 2009 Tipo de documento: Article