Pages that link to "Item:Q1738320"
From MaRDI portal
The following pages link to Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies (Q1738320):
Displaying 9 items.
- Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies (Q383123) (← links)
- Novel phylogenetic network distances based on cherry picking (Q2061999) (← links)
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees (Q2118383) (← 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)
- Combining Networks Using Cherry Picking Sequences (Q5041128) (← links)
- Linear Time Algorithm for Tree-Child Network Containment (Q5041129) (← links)
- The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings (Q6564619) (← links)
