Algorithmic Aspects of Tree Amalgamation

DOI10.1006/jagm.2000.1116zbMath0964.68108OpenAlexW2031620310MaRDI QIDQ4521528

Sebastian Böcker, Andreas W. M. Dress, David Bryant, Mike A. Steel

Publication date: 19 December 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10092/238

zbMATH Keywords

amalgamation of leaf-labeled trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Closure operations in phylogenetics ⋮ Slim sets of binary trees ⋮ Unique Perfect Phylogeny Is NP-Hard ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Patchworks ⋮ Recovering a phylogenetic tree using pairwise closure operations ⋮ An algebraic foundation for automatic feature-based program synthesis ⋮ Characterizing phylogenetically decisive taxon coverage ⋮ Patching up \(X\)-trees

This page was built for publication: Algorithmic Aspects of Tree Amalgamation