Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable

@article{Kelk2012ConstructingMP,
  title={Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable},
  author={S. Kelk and C{\'e}line Scornavacca},
  journal={Algorithmica},
  year={2012},
  volume={68},
  pages={886-915}
}
  • S. Kelk, Céline Scornavacca
  • Published 2012
  • Mathematics, Computer Science, Biology
  • Algorithmica
  • Here we show that, given a set of clusters ${\mathcal{C}}$ on a set of taxa ${\mathcal{X}}$, where $|{\mathcal{X}}|=n$, it is possible to determine in time f(k)⋅poly(n) whether there exists a level-≤k network (i.e. a network where each biconnected component has reticulation number at most k) that represents all the clusters in ${\mathcal{C}}$ in the softwired sense, and if so to construct such a network. This extends a result from Kelk et al. (in IEEE/ACM Trans. Comput. Biol. Bioinform. 9:517… CONTINUE READING
    17 Citations
    Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees
    • 9
    • PDF
    On Computing the Maximum Parsimony Score of a Phylogenetic Network
    • 17
    • PDF
    Kernelizations for the hybridization number problem on multiple nonbinary trees
    • 15
    • PDF
    Hybridization Number on Three Rooted Binary Trees is EPT
    • 16
    • PDF
    On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems
    • 13
    • PDF
    Finding a most parsimonious or likely tree in a network with respect to an alignment
    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
    • 3
    • PDF
    A reconstruction problem for a class of phylogenetic networks with lateral gene transfers
    • 9
    • PDF
    Hybridization Number on Three Trees
    • 2

    References

    SHOWING 1-10 OF 37 REFERENCES
    Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
    • 26
    Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets
    • 66
    • PDF
    Constructing a Smallest Refining Galled Phylogenetic Network
    • 36
    • PDF
    On the Elusiveness of Clusters
    • 18
    • PDF
    Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks
    • 39
    • PDF
    Constructing the Simplest Possible Phylogenetic Network from Triplets
    • 49
    • PDF
    Algorithms for combining rooted triplets into a galled phylogenetic network
    • 44
    • PDF
    Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable
    • M. Bordewich, C. Semple
    • Computer Science
    • IEEE/ACM Transactions on Computational Biology and Bioinformatics
    • 2007
    • 72
    • PDF
    Computing galled networks from real data
    • 61
    • PDF
    A Decomposition Theory for Phylogenetic Networks and Incompatible Characters
    • 41
    • PDF