Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms

DOI10.1007/978-3-642-32241-9_45zbMath1365.92075OpenAlexW2236552701MaRDI QIDQ2914355

Oliver Eulenstein, Paweł Górecki

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

zbMATH Keywords

unrooted gene trees

Mathematics Subject Classification ID

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

Related Items (1)

Rooting gene trees via phylogenetic networks

This page was built for publication: Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms