A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies

DOI10.1007/978-3-662-48221-6_7zbMath1367.92081OpenAlexW2238253283MaRDI QIDQ5283825

Benjamin Drinkwater, M. A. Charleston

Publication date: 25 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48221-6_7

zbMATH Keywords

phylogenycoevolutionNP-hardnesstree reconciliationtree shape

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today.
• The probabilities of rooted tree-shapes generated by random bifurcation
• Properties of phylogenetic trees generated by Yule-type speciation models

This page was built for publication: A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies