Fixed-parameter Tractability of the Maximum Agreement Supertree Problem

Sylvain Guillemot (1) , Vincent Berry (1)

1 MAB - Méthodes et Algorithmes pour la Bioinformatique

Given a ground set $L$ of labels and a collection of trees whose leaves are bijectively labelled by some elements of $L$, the Maximum Agreement Supertree problem (\pSMAST) is the following: find a tree $T$ on a largest label set $L' \subseteq L$ that homeomorphically contains every input tree restricted to $L'$. The problem finds applications in phylogenetics, databases and data mining. In this paper we focus on the parameterized complexity of this NP-hard problem. We consider different combinations of parameters for SMAST as well as particular cases, providing both FPT algorithms and intractability results.

Domaines: Algorithme et structure de données [cs.DS]; Complexité [cs.CC]; Bio-informatique [q-bio.QM]

Sylvain Guillemot, Vincent Berry. Fixed-parameter Tractability of the Maximum Agreement Supertree Problem. CPM: Combinatorial Pattern Matching, 2007, Montpellier, France. pp.274-285. ⟨lirmm-00130406v2⟩