The following pages link to When two trees go to war (Q2261656):
Displaying 15 items.
- Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies (Q383123) (← links)
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- All that glisters is not galled (Q733254) (← links)
- A universal tree-based network with the minimum number of reticulations (Q1801081) (← links)
- On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091) (← links)
- Trinets encode tree-child and level-2 phylogenetic networks (Q2249670) (← links)
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters (Q2358415) (← links)
- Uprooted phylogenetic networks (Q2408571) (← links)
- A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
- Accumulation phylogenies (Q2494456) (← links)
- The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)
- On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626) (← links)
- Research in Computational Molecular Biology (Q5706864) (← links)
- Research in Computational Molecular Biology (Q5706869) (← links)
