The following pages link to Combinatorial Pattern Matching (Q5315328):
Displaying 13 items.
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Rooted maximum agreement supertrees (Q818677) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms (Q4376196) (← links)
- (Q4532062) (← links)
- Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees (Q4910733) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
- LATIN 2004: Theoretical Informatics (Q5901669) (← links)
- Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees (Q6487649) (← links)