Revisiting the Minimum Breakpoint Linearization Problem

Abstract : The gene order on a chromosome is a necessary data for most comparative genomics studies, but in many cases only partial orders can be obtained by current genetic mapping techniques. The Minimum Breakpoint Linearization Problem aims at constructing a total order from this partial knowledge, such that the breakpoint distance to a reference genome is minimized. In this paper, we first expose a flaw in two algorithms formerly known for this problem [5,3]. We then present a new modeling for this problem, and use it to design three approximation algorithms, with ratios resp. O(log(k) log log(k)), O(log2(|X|)) and m2+4m−4, where k is the optimal breakpoint distance we look for, |X| is upper bounded by the number of pair of genes for which the partial order is in contradiction with the reference genome, and m is the number of genetic maps used to create the input partial order.
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00482856
Contributor : Guillaume Fertin <>
Submitted on : Tuesday, May 11, 2010 - 4:32:35 PM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Document(s) archivé(s) le : Thursday, September 16, 2010 - 2:20:13 PM

File

TAMC2010.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00482856, version 1

Collections

Citation

Laurent Bulteau, Guillaume Fertin, Irena Rusu. Revisiting the Minimum Breakpoint Linearization Problem. 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174. ⟨hal-00482856⟩

Share

Metrics

Record views

168

Files downloads

98