Pages that link to "Item:Q1741507"

The following pages link to Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507):

Displaying 4 items.

• 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)