A linear-time algorithm to sample the dual-birth model
Keyword(s):
AbstractThe ability to sample models of tree evolution is essential in the analysis and interpretation of phylogenetic trees. The dual-birth model is an extension of the traditional birth-only model and allows for sampling trees of varying degrees of balance. However, for a tree with n leaves, the tree sampling algorithm proposed in the original paper is 𝒪(n log n). I propose an algorithm to sample trees under the dual-birth model in 𝒪(n), and I provide a fast C++ implementation of the proposed algorithm.
Keyword(s):
2000 ◽
Vol 11
(03)
◽
pp. 365-371
◽
Keyword(s):
2012 ◽
Vol 160
(3)
◽
pp. 210-217
◽
Keyword(s):