An optimal algorithm to reconstruct trees from additive distance data |
| |
Authors: | Jotun J Hein |
| |
Institution: | (1) Center for Molecular Genetics, UCSD, 92093 La Jolla, CA, USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|