Hybridization Number on Three Rooted Binary Trees is EPT

@article{Iersel2016HybridizationNO,
  title={Hybridization Number on Three Rooted Binary Trees is EPT},
  author={L. Iersel and S. Kelk and N. Lekic and Chris Whidden and N. Zeh},
  journal={SIAM J. Discret. Math.},
  year={2016},
  volume={30},
  pages={1607-1631}
}
  • L. Iersel, S. Kelk, +2 authors N. Zeh
  • Published 2016
  • Computer Science, Mathematics
  • SIAM J. Discret. Math.
  • Phylogenetic networks are leaf-labelled directed acyclic graphs that are used to describe non-treelike evolutionary histories and are thus a generalization of phylogenetic trees. The hybridization number of a phylogenetic network is the sum of all indegrees minus the number of nodes plus one. The Hybridization Number problem takes as input a collection of phylogenetic trees and asks to construct a phylogenetic network that contains an embedding of each of the input trees and has a smallest… CONTINUE READING
    16 Citations
    Kernelizations for the hybridization number problem on multiple nonbinary trees
    • 16
    • PDF
    When is a Phylogenetic Network Simply an Amalgamation of Two Trees?
    • 3
    • PDF
    Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation
    • 2
    A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
    • S. Kelk, S. Linz
    • Mathematics, Computer Science
    • SIAM J. Discret. Math.
    • 2019
    • 4
    • PDF
    Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
    • 9
    • Highly Influenced
    • PDF
    Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm
    • PDF
    Combining Networks Using Cherry Picking Sequences
    • PDF
    An analysis of the Geodesic Distance and other comparative metrics for tree-like structures
    • PDF

    References

    SHOWING 1-10 OF 29 REFERENCES
    Kernelizations for the hybridization number problem on multiple nonbinary trees
    • 16
    • PDF
    Approximation Algorithms for Nonbinary Agreement Forests
    • 17
    • PDF
    An Algorithm for Constructing Parsimonious Hybridization Networks with Multiple Phylogenetic Trees
    • Y. Wu
    • Mathematics, Computer Science
    • J. Comput. Biol.
    • 2013
    • 21
    • PDF
    Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable
    • 72
    • PDF
    Computing the minimum number of hybridization events for a consistent evolutionary history
    • 130
    • PDF
    Phylogenetic Networks - Concepts, Algorithms and Applications
    • 279
    • PDF
    On the Elusiveness of Clusters
    • 18
    • PDF
    A quadratic kernel for computing the hybridization number of multiple trees
    • 25
    • PDF
    A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees
    • Teresa Piovesan, S. Kelk
    • Mathematics, Computer Science
    • IEEE/ACM Transactions on Computational Biology and Bioinformatics
    • 2013
    • 20
    • PDF