Phylogenetic information complexity: Is testing a tree easier than finding it?
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 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.
Cite
@article{arxiv.0807.1756,
title = {Phylogenetic information complexity: Is testing a tree easier than finding it?},
author = {Mike Steel and Laszlo Szekely and Elchanan Mossel},
journal= {arXiv preprint arXiv:0807.1756},
year = {2008}
}
Comments
15 pages, 3 figures