@inproceedings{7851ee31445e4a06aab1fff50e13e89c,

title = "Kernel and Fast Algorithm for Dense Triplet Inconsistency",

abstract = "We study the parameterized complexity of inferring supertrees from sets of rooted triplets, an important problem in phylogenetics. For a set l of labels and a dense set \mathcal r\mathcal r of triplets distinctly leaf-labeled by 3-subsets of l we seek a tree distinctly leaf-labeled by l and containing all but at most p triplets from \mathcal r\mathcal r as homeomorphic subtree. Our results are the first polynomial kernel for this problem, with o(p 2) labels, and a subexponential fixed-parameter algorithm running in time 2^{o(p^{1/3} \log p)} + o(n^4)2^{o(p^{1/3} \log p)} + o(n^4).",

author = "Sylvain Guillemot and Matthias Mnich",

year = "2010",

doi = "10.1007/978-3-642-13562-0_23",

language = "English",

isbn = "978-3-642-13561-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "247--257",

editor = "J. Kratochvil and A. Li and J. Fiala and P. Kolman",

booktitle = "Theory and Applications of Models of Computation. TAMC 2010",

address = "United States",

}