Kernelizations for the hybridization number problem on multiple nonbinary trees

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 Numb...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 82; no. 6; pp. 1075 - 1089
Main Authors:	van Iersel, Leo, Kelk, Steven, Scornavacca, Celine
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2016 Elsevier
Subjects:	Algorithms Bioinformatics Collection Computer Science Computer simulation Displays Fixed-parameter tractability Hybridization number Kernelization Kernels Mathematical analysis Mathematical models Phylogenetic network Phylogenetic tree Trees Hybridization number Phylogenetic network Fixed-parameter tractability Phylogenetic tree Kernelization phylogenetic network phylogenetic tree hybridization number kernelization
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!