A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model

Details A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model

2009-04-10

arxiv.org/abs/0904.1645v2

Computer Science

Discrete Mathematics

Scientific paper

We consider the following problem: from a given set of gene families trees on a set of genomes, find a first speciation, that splits these genomes into two subsets, that minimizes the number of gene duplications that happened before this speciation. We call this problem the Minimum Duplication Bipartition Problem. Using a generalization of the Minimum Edge-Cut Problem, known as Submodular Function Minimization, we propose a polynomial time and space 3-approximation algorithm for the Minimum Duplication Bipartition Problem.

Affiliated with

Also associated with

No associations

Rating

A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model 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 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-673784