@article{acac7143603d4d80bb49a470f7237a55,

title = "Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable",

abstract = "Here we show that, given a set of clusters on a set of taxa , where , it is possible to determine in time f(k)a <...poly(n) whether there exists a level-a parts per thousand currency signk network (i.e. a network where each biconnected component has reticulation number at most k) that represents all the clusters in 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-534, 2012) which showed that the problem is polynomial-time solvable for fixed k. By defining {"}k-reticulation generators{"} analogous to {"}level-k generators{"}, we then extend this fixed parameter tractability result to the problem where k refers not to the level but to the reticulation number of the whole network.",

author = "Steven Kelk and Celine Scornavacca",

year = "2014",

doi = "10.1007/s00453-012-9708-5",

language = "English",

volume = "68",

pages = "886--915",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer Verlag",

number = "4",

}