Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer ScienceReportar como inadecuado

Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

* Corresponding author 1 LINA - Laboratoire d-Informatique de Nantes Atlantique

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 cur- rent 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 6, 4. We then present a new modeling for this problem, and use it to design three approximation algorithms, with ratios resp. Ologk log logk, Olog2 |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.

Keywords : approximation algorithms partially ordered genome breakpoint distance comparative genomics

Autor: Laurent Bulteau - Guillaume Fertin - Irena Rusu -



Documentos relacionados