Deep coalescence reconciliation with unrooted gene trees: linear time algorithms

DOI10.1007/978-3-642-32241-9_45zbMATH Open1365.92075OpenAlexW2236552701MaRDI QIDQ2914355FDOQ2914355

Authors: Paweł Górecki, Oliver Eulenstein 

Publication date: 25 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_45

Recommendations

• A linear-time algorithm for reconciliation of non-binary gene tree and binary species tree
• Reconciliation with nonbinary gene trees revisited
• Reconciling a gene tree to a species tree under the duplication cost model
• Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks.
• A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies

zbMATH Keywords

unrooted gene trees

Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Cited In (3)

• Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks.
• Phylogenetic network-assisted rooting of unrooted gene trees
• Rooting gene trees via phylogenetic networks

This page was built for publication: Deep coalescence reconciliation with unrooted gene trees: linear time algorithms

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