Rooted maximum agreement supertrees

DOI10.1007/S00453-004-1147-5zbMATH Open1086.68103OpenAlexW2146149072MaRDI QIDQ818677FDOQ818677

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

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

Mathematics Subject Classification ID

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

Cited In (23)

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

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)