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

Abstract : 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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00374851
Contributeur : Cedric Chauve <>
Soumis le : mardi 14 avril 2009 - 22:52:18
Dernière modification le : jeudi 11 janvier 2018 - 06:20:16
Archivage à long terme le : mercredi 22 septembre 2010 - 12:21:00

Fichiers

ARXIV.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00374851, version 2
  • ARXIV : 0904.1645

Collections

Citation

Cedric Chauve, Aïda Ouangraoua. A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model. 2009. ⟨hal-00374851v2⟩

Partager

Métriques

Consultations de la notice

337

Téléchargements de fichiers

154