Pages that link to "Item:Q1741507"
From MaRDI portal
The following pages link to Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507):
Displaying 8 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)
- On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091) (← links)
- Novel phylogenetic network distances based on cherry picking (Q2061999) (← links)
- New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees (Q2149104) (← links)
- On cherry-picking and network containment (Q2219064) (← links)
- The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)
- Linear Time Algorithm for Tree-Child Network Containment (Q5041129) (← links)