Rooted maximum agreement supertrees

DOI10.1007/S00453-004-1147-5MaRDI QIDQ818677zbMATH OpenOpenAlexFDO

Authors Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• LATIN 2004: Theoretical Informatics
• Improved algorithms for maximum agreement and compatible supertrees
• Combinatorial Pattern Matching
• Maximum agreement and compatible supertrees
• Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees

Cited in

(23)

• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• Improved algorithms for maximum agreement and compatible supertrees
• LATIN 2004: Theoretical Informatics
• Reconstructing gene trees from Fitch's xenology relation
• Indirect identification of horizontal gene transfer
• Kernel and fast algorithm for dense triplet inconsistency
• Combinatorial Pattern Matching
• A supertree method for rooted trees
• New heuristics for rooted triplet consistency
• Combinatorial Pattern Matching
• New results on optimizing rooted triplets consistency
• Computing the maximum agreement of phylogenetic networks
• An efficient algorithm for supertrees
• Polynomial-time algorithms for the ordered maximum agreement subtree problem
• Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
• Algorithms and Computation
• Building a small and informative phylogenetic supertree
• scientific article; zbMATH DE number 7564377 (Why is no real title available?)
• The matroid structure of representative triple sets and triple-closure computation
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• scientific article; zbMATH DE number 1746436 (Why is no real title available?)
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Maximum agreement and compatible supertrees

This page was built for publication: Rooted maximum agreement supertrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818677)