A note on efficient computation of hybridization number via softwired clusters

Details A note on efficient computation of hybridization number via softwired clusters A note on efficient computation of hybridization number via softwired clusters

2011-08-23

arxiv.org/abs/1108.4642v1

Biology

Quantitative Biology

Populations and Evolution

Scientific paper

Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted binary phylogenetic trees on taxon set X in time (6r)^r.poly(n), where n=|X|. The novelty of this approach is that it avoids the use of Maximum Acyclic Agreement Forests (MAAFs) and instead exploits the equivalence of the problem with a related problem from the softwired clusters literature. This offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem.

Affiliated with

Also associated with

No associations

Rating

A note on efficient computation of hybridization number via softwired clusters 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 note on efficient computation of hybridization number via softwired clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on efficient computation of hybridization number via softwired clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67554