A quadratic kernel for computing the hybridization number of multiple trees

Authors:
Leo Van Iersel;Simone Linz
Affiliations:
Centrum Wiskunde & Informatica (CWI), P.O. Box 94079, 1090 GB, Amsterdam, Netherlands;Center for Bioinformatics, University of Tübingen, Sand 14, 72076 Tübingen, Germany
Venue:
Information Processing Letters
Year:
2013

Citing 9
Cited 0

Computing the minimum number of hybridization events for a consistent evolutionary history

Discrete Applied Mathematics
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Seeing the trees and their branches in the network is hard

Theoretical Computer Science
Hybridization in Nonbinary Trees

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees

Bioinformatics
On the Complexity of uSPR Distance

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms for Reticulate Networks of Multiple Phylogenetic Trees

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the Elusiveness of Clusters

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast computation of the exact hybridization number of two phylogenetic trees

ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

It has recently been shown that the NP-hard problem of calculating the minimum number of hybridization events that is needed to explain a set of rooted binary phylogenetic trees by means of a hybridization network is fixed-parameter tractable if an instance of the problem consists of precisely two such trees. In this paper, we show that this problem remains fixed-parameter tractable for an arbitrarily large set of rooted binary phylogenetic trees. In particular, we present a quadratic kernel.