Article Dans Une Revue Journal of Computer and System Sciences Année : 2016

Kernelizations for the hybridization number problem on multiple nonbinary trees

Résumé

Given a finite set X, a collection T of rooted phylogenetic trees on X and an integer k, the Hybridization Number problem asks if there exists a phylogenetic network on X that displays all trees from T and has reticulation number at most k. We show two kernelization algorithms for Hybridization Number, with kernel sizes 4k(5k) t and 20k 2 (∆ + − 1) respectively, with t the number of input trees and ∆ + their maximum outdegree. Experiments on simulated data demonstrate the practical relevance of our kernelization algorithms. In addition, we present an n f (k) t-time algorithm, with n = |X| and f some computable function of k.

Fichier principal
Vignette du fichier
Scornavacca_23.pdf (435.19 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-02154926 , version 1 (16-12-2019)

Licence

Identifiants

Citer

Leo van Iersel, Steven Kelk, Celine Scornavacca. Kernelizations for the hybridization number problem on multiple nonbinary trees. Journal of Computer and System Sciences, 2016, 82 (6), pp.1075-1089. ⟨10.1016/j.jcss.2016.03.006⟩. ⟨hal-02154926⟩
148 Consultations
141 Téléchargements

Altmetric

Partager

  • More