Skip to Main content Skip to Navigation
Conference papers

Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps

Raluca Uricaru 1 Alban Mancheron 1 Eric Rivals 1, *
* Corresponding author
1 MAB - Méthodes et Algorithmes pour la Bioinformatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In practice, using local alignments as fragments, instead of MEMs, generates frequent overlaps between fragments, due to combinatorial reasons and biological factors, i.e. variable tandem repeat structures that differ in number of copies between genomic sequences. In this paper, in order to raise this limitation, we formulate a novel definition of a chain, allowing overlaps proportional to the fragments lengths, and exhibit an efficient algorithm for computing such a maximum weighted chain. We tested our algorithm on a dataset composed of 694 genome couples and accounted for significant improvements in terms of coverage, while keeping the running times below reasonable limits.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Eric Rivals <>
Submitted on : Wednesday, October 20, 2010 - 6:40:23 PM
Last modification on : Thursday, September 19, 2019 - 1:14:16 PM
Long-term archiving on: : Friday, October 26, 2012 - 11:46:44 AM


Files produced by the author(s)




Raluca Uricaru, Alban Mancheron, Eric Rivals. Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps. RECOMB-CG: Comparative Genomics, Oct 2010, Ottawa, Canada. pp.161-172, ⟨10.1007/978-3-642-16181-0_14⟩. ⟨lirmm-00527915⟩



Record views


Files downloads