Computing a consensus of multilabeled trees

DOI10.1137/1.9781611972924.9zbMath1430.68473OpenAlexW1780575089MaRDI QIDQ5233721

Andreas Spillner, Radoslaw Suchecki, Sabine Storandt, Vincent L. Moulton, Katharina T. Huber

Publication date: 12 September 2019

Published in: 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/36a2c43fe1a94aafd5a5ca7dbf1ee83718b275ce

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Problems related to evolution (92D15)

Related Items (5)

Folding and unfolding phylogenetic trees and networks ⋮ The hybrid number of a ploidy profile ⋮ Phylogenetic networks that are their own fold-ups ⋮ MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms ⋮ Complexity and algorithms for MUL-tree pruning

This page was built for publication: Computing a consensus of multilabeled trees