Combinatorial Pattern Matching

DOI10.1007/B98377MaRDI QIDQ5315328zbMATH OpenFDO

Authors Vincent Berry, François Nicolas

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Recommendations

• Maximum agreement and compatible supertrees
• Rooted maximum agreement supertrees
• LATIN 2004: Theoretical Informatics
• On the approximability of the maximum agreement subtree and maximum compatible tree problems
• Improved algorithms for maximum agreement and compatible supertrees

Cited in

(21)

• Linear time 3-approximation for the MAST problem
• Rooted maximum agreement supertrees
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• Fixed-parameter algorithms for finding agreement supertrees
• Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• Analogs & duals of the MAST problem for sequences & trees
• Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
• scientific article; zbMATH DE number 1947052 (Why is no real title available?)
• Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees
• Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time
• Maximum agreement and compatible supertrees
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• On the approximability of the maximum agreement subtree and maximum compatible tree problems
• Improved algorithms for maximum agreement and compatible supertrees
• Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 1746436 (Why is no real title available?)
• Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Computing and Combinatorics

This page was built for publication: Combinatorial Pattern Matching

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