Discrete coalescent trees

DOI10.1007/S00285-021-01685-0MaRDI QIDQ96722zbMATH OpenOpenAlexWikidataFDO

Authors Lena Collienne, Kieran Elmes, Mareike Fischer, David Bryant, Alex Gavryushkin, Lena Collienne, Kieran Elmes, Mareike Fischer, David Bryant

Publication date November 2021

Published in Journal of Mathematical Biology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00285-021-01685-0

zbMATH Keywords

algorithmscoalescent treesmetric geometryphylogeneticsranked treetime treestree distancetree space

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Coalescent histories for discordant gene trees and species trees
• Diffusion processes and coalescent trees
• The tree length of an evolving coalescent
• Coalescent time distributions in trees of arbitrary size
• Coalescent lineage distributions
• On coalescence analysis using genealogy rooted trees
• Trees within trees: simple nested coalescents
• Phylogeny. Discrete and random processes in evolution
• scientific article; zbMATH DE number 1094275
• Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els

Cites work

• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• scientific article; zbMATH DE number 6297698 (Why is no real title available?)
• Computing nearest neighbour interchange distances between ranked phylogenetic trees
• Forward and backward evolutionary processes and allele frequency spectrum in a cancer cell population
• Geometry of the space of phylogenetic trees
• On computing the nearest neighbor interchange distance
• On the computational complexity of the rooted subtree prune and regraft distance
• Polyhedral computational geometry for averaging metric phylogenetic trees
• Polyhedral geometry of phylogenetic rogue taxa
• The coalescent
• The combinatorics of discrete time-trees: theory and open problems
• The space of ultrametric phylogenetic trees
• The time complexity of the token swapping problem and its parallel variants

Cited in

(4)

• Coalescent histories for discordant gene trees and species trees
• rrnni
• Ranked subtree prune and regraft
• Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els

Describes a project that uses

Uses Software

• RAxML-NG
• treeOclock
• BEAST
• MrBayes

This page was built for publication: Discrete coalescent trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q96722)