Digitale Medien
Springer
Bulletin of mathematical biology
51 (1989), S. 597-603
ISSN:
1522-9602
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Biologie
,
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF02459968
|
Standort |
Signatur |
Erwartet |
Verfügbarkeit |
