Maximal Accurate Forests from Distance Matrices
We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarantee accuracy when knowledge about the model tree, i.e bounds on the edge lengths, is not assumed. Second, our algorithm guarantees that, with high probability, no false assertions are made. The algorithm produces a maximal forest of the model tree, in time Õ(n3) in the typical case. Empirical testing has been promising, comparing favorably to Neighbor Joining, with the advantage of making few or no false assertions about the topology of the model tree; guarantees against false positives can be controlled as a parameter by the user.
Unable to display preview. Download preview PDF.
- 1.Buneman, P.: The recovery of trees from measures of dissimilarity. In: Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)Google Scholar
- 9.Mossel, E.: Distorted metrics on trees and phylogenetic forests. IEEE Comp. Biol. and Bioinformatics (to appear, 2004), Availible at: http://arxiv.org/abs/math.CO/0403508
- 10.Mossel, E.: Phase Transitions in Phylogeny. Trans. Amer. Math. Soc. 356(6), 2379–2404 (2004) (electronic)Google Scholar
- 11.Neyman, J.: Molecular studies of evolution: a source of novel statistical problems. In: Gupta, S., Yackel, J. (eds.) Statistical Decision Theory and Related Topics. Academic Press, New York (1971)Google Scholar
- 12.Saitou, N., Nei, M.: The neighbor-joing method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406–425 (1987)Google Scholar
- 13.Usman, R., Moret, B., Warnow, T., Williams, T.: Rec-I-DCM3: A fast algorithmic technique for reconstructing large phylogenetic trees. In: Proc. IEEE Computer Society Bioinformatics Conference CSB 2004. Stanford Univ. (2004)Google Scholar