Pages that link to "Item:Q1949091"
From MaRDI portal
The following pages link to On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091):
Displayed 7 items.
- Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies (Q383123) (← links)
- On the existence of a cherry-picking sequence (Q1694728) (← links)
- Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies (Q1738320) (← links)
- Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507) (← links)
- New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees (Q2149104) (← links)
- Orchard networks are trees with additional horizontal arcs (Q2155699) (← links)
- The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)