Novel definition and algorithm for chaining fragments with proportional overlaps - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Computational Biology Year : 2011

Novel definition and algorithm for chaining fragments with proportional overlaps

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, i.e. Maximal Exact Matches, 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 pairs and accounted for significant improvements in terms of coverage, while keeping the running times below reasonable limits. Moreover, experiments with different ratios of allowed overlaps showed the robustness of the chains with respect to these ratios.
Fichier principal
Vignette du fichier
OverlapChaining-author-copy.pdf (412.58 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-00834143 , version 1 (14-06-2013)

Identifiers

Cite

Raluca Uricaru, Alban Mancheron, Eric Rivals. Novel definition and algorithm for chaining fragments with proportional overlaps. Journal of Computational Biology, 2011, 18 (9), pp.1141-1154. ⟨10.1089/cmb.2011.0126⟩. ⟨lirmm-00834143⟩
387 View
561 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More