Kernel and Fast Algorithm for Dense Triplet Inconsistency

Sylvain Guillemot, Matthias Mnich

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


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).
Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation. TAMC 2010
EditorsJ. Kratochvil, A. Li, J. Fiala, P. Kolman
ISBN (Electronic)978-3-642-13562-0
ISBN (Print)978-3-642-13561-3
Publication statusPublished - 2010
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science


Dive into the research topics of 'Kernel and Fast Algorithm for Dense Triplet Inconsistency'. Together they form a unique fingerprint.

Cite this