An optimal algorithm to reconstruct trees from additive distance data
- 82 Downloads
In this article the question of reconstructing a phylogeny from additive distance data is addressed. Previous algorithms used the complete distance matrix of then OTUs (Operational Taxonomic Unit), that corresponds to the tips of the tree. This usedO(n 2) computing time. It is shown that this is wasteful for biologically reasonable trees. If the tree has internal nodes with degrees that are bounded onO(n*log(n)) algorithm is possible. It is also shown if the nodes can have unbounded degrees the problem hasn 2 as lower bound.
KeywordsReference Sequence Internal Node Operational Taxonomic Unit Pairwise Distance Deep Point
Unable to display preview. Download preview PDF.
- Buneman, P. 1971. “The Recovery of Trees from Measures of Dissimilarity.” In:Mathematics in the Archaeological and Historical Sciences, F.R. Hodson, D.G. Kendall and P. Tautu (Eds), pp. 387–395. Edinburgh University Press.Google Scholar
- Hein, J.J. 1988. “A Fast Tree Reconstruction Method.”Molec. biol. Evol., submitted.Google Scholar