A linear-time algorithm to sample the dual-birth model
Abstract
The 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 [O](n log n). I propose an algorithm to sample trees under the dual-birth model in [O](n), and I provide a fast C++ implementation of the proposed algorithm.
02 /Specification & Classification
Click any tag to browse matching papersReproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Probabilities of tree topologies with temporal constraints and diversification shifts
G. Didier·bioRxiv·Dec 18, 2019
- Bayesian molecular dating as a "doubly intractable" problem
S. Guindon·bioRxiv·Feb 6, 2017
- No-U-Turn sampling for phylogenetic trees
Johannes Wahle·bioRxiv·Mar 16, 2021
- The probability distribution of the reconstructed phylogenetic tree with occurrence data
A. Gupta, M. Manceau, … T. Stadler·bioRxiv·Jun 21, 2019
- The combinatorics of discrete time-trees: theory and open problems
A. Gavryushkin, C. Whidden, F. Matsen·bioRxiv·Jul 12, 2016
- A balance index for phylogenetic trees based on quartets
Tomás M. Coronado, Arnau Mir, … Gabriel Valiente·bioRxiv·Mar 5, 2018