Discrete coalescent trees
From MaRDI portal
Publication:96722
DOI10.1007/s00285-021-01685-0zbMath1475.92116OpenAlexW3210115145WikidataQ113905441 ScholiaQ113905441MaRDI QIDQ96722
Kieran Elmes, Alex Gavryushkin, David Bryant, Lena Collienne, Mareike Fischer, Kieran Elmes, Lena Collienne, Mareike Fischer, David Bryant
Publication date: November 2021
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00285-021-01685-0
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The combinatorics of discrete time-trees: theory and open problems
- Computing nearest neighbour interchange distances between ranked phylogenetic trees
- The space of ultrametric phylogenetic trees
- Polyhedral geometry of phylogenetic rogue taxa
- The coalescent
- Geometry of the space of phylogenetic trees
- Forward and backward evolutionary processes and allele frequency spectrum in a cancer cell population
- On the computational complexity of the rooted subtree prune and regraft distance
- Polyhedral computational geometry for averaging metric phylogenetic trees
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants
This page was built for publication: Discrete coalescent trees