Constructing the R* Consensus Tree of Two Trees in Subcubic Time

DOI10.1007/978-3-642-15775-2_49zbMath1287.68177OpenAlexW1515253174MaRDI QIDQ3586493

Jesper Jansson, Wing-Kin Sung

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_49

Mathematics Subject Classification ID

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

Related Items (1)

Constructing the R* consensus tree of two trees in subcubic time

This page was built for publication: Constructing the R* Consensus Tree of Two Trees in Subcubic Time