A quadratic kernel for computing the hybridization number of multiple trees

Details A quadratic kernel for computing the hybridization number of multiple trees A quadratic kernel for computing the hybridization number of multiple trees

2012-03-19

arxiv.org/abs/1203.4067v1

Biology

Quantitative Biology

Populations and Evolution

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A quadratic kernel for computing the hybridization number of multiple trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A quadratic kernel for computing the hybridization number of multiple trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A quadratic kernel for computing the hybridization number of multiple trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212250