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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of computer and system sciences Ročník 82; číslo 6; s. 1075 - 1089
Hlavní autori:	van Iersel, Leo, Kelk, Steven, Scornavacca, Celine
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.09.2016 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!