Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms

Abstract : Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of markers from each map such that the two extracted sequences are decomposable into non-overlapping strips (or synteny blocks). This aims at defining a robust set of synteny blocks between different species, which is a key to understand the evolution process since their last common ancestor. In this paper, we add a fundamental constraint to the initial problem, which expresses the biologically sustained need to bound the number of intermediate (non-selected) markers between two consecutive markers in a strip. We therefore introduce the problem d-gap-MSR, where d is a (usually small) non-negative integer that upper bounds the number of non-selected markers between two consecutive markers in a strip. Depending on the nature of the comparative maps (i.e., with or without duplicates), we show that d-gap-MSR is NP-complete for any d ≥ 1, and even APX-hard for any d ≥ 2. We also provide two approximation algorithms, with ratio 1.8 for d = 1, and ratio 4 for d ≥ 2.
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00425145
Contributor : Guillaume Fertin <>
Submitted on : Tuesday, October 20, 2009 - 12:16:10 PM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Document(s) archivé(s) le : Tuesday, June 15, 2010 - 9:59:54 PM

File

MSRFinal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00425145, version 1

Collections

Citation

Laurent Bulteau, Guillaume Fertin, Irena Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719. ⟨hal-00425145⟩

Share

Metrics

Record views

198

Files downloads

105