Pages that link to "Item:Q5901669"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901669):
Displaying 10 items.
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Rooted maximum agreement supertrees (Q818677) (← links)
- A supertree method for rooted trees (Q1582076) (← links)
- An efficient algorithm for supertrees (Q1901397) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q2642315) (← links)
- Computing the maximum agreement of phylogenetic networks (Q2845521) (← links)
- (Q4532062) (← links)
- Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees (Q4910733) (← links)
- Combinatorial Pattern Matching (Q5315328) (← links)