| 研究概要 |
We developed new deterministic algorithms for constructing several popular types of consensus trees that are faster than all the previously known ones.
Given k phylogenetic trees with n leaves each and with identical leaf label sets, our algorithms run in O(n k) time [majority rule consensus tree], O(n k) time [loose consensus tree], O(n**2 k) time [greedy consensus tree], and min(O(k n**2), O(k n (k + log**2 n))) time [frequency difference consensus tree].
In particular, our new algorithm for the majority rule consensus tree solves an open problem from the 1980s.
We also implemented our algorithms to make sure that they are practical and applied them to various simulated data sets.
|
