Corpus ID: 14702123

Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees

@article{Kelk2012TowardsTF,
  title={Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees},
  author={S. Kelk and C{\'e}line Scornavacca},
  journal={ArXiv},
  year={2012},
  volume={abs/1207.7034}
}

• S. Kelk, Céline Scornavacca
• Published 2012
• Biology, Computer Science, Mathematics
• ArXiv

It has remained an open question for some time whether, given a set of not necessarily binary (i.e. "nonbinary") trees T on a set of taxa X, it is possible to determine in time f(r).poly(m) whether there exists a phylogenetic network that displays all the trees in T, where r refers to the reticulation number of the network and m=|X|+|T|. Here we show that this holds if one or both of the following conditions holds: (1) |T| is bounded by a function of r; (2) the maximum degree of the nodes in T… Expand

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed