Rooted maximum agreement supertrees
From MaRDI portal
Publication:818677
DOI10.1007/s00453-004-1147-5zbMath1086.68103OpenAlexW2146149072MaRDI QIDQ818677
Wing-Kin Sung, Jesper Jansson, Kunihiko Sadakane, Joseph H.-K. Ng
Publication date: 21 March 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1147-5
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (12)
Inferring a level-1 phylogenetic network from a dense set of rooted triplets ⋮ Kernel and fast algorithm for dense triplet inconsistency ⋮ Building a small and informative phylogenetic supertree ⋮ Improved algorithms for maximum agreement and compatible supertrees ⋮ New heuristics for rooted triplet consistency ⋮ Maximum agreement and compatible supertrees ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ New results on optimizing rooted triplets consistency ⋮ Fixed-Parameter Algorithms for Finding Agreement Supertrees ⋮ Unnamed Item ⋮ Reconstructing gene trees from Fitch's xenology relation ⋮ Indirect identification of horizontal gene transfer
This page was built for publication: Rooted maximum agreement supertrees
