Finding Nested Common Intervals Efficiently - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Finding Nested Common Intervals Efficiently


In this paper, we study the problem of effi ciently fi nding gene clusters formalized by nested common intervals between two genomes represented either as permutations or as sequences. Considering permutations, we give several algorithms whose running time depends on the size of the actual output rather than the output in the worst case. Indeed, we first provide a straightforward O(n^3) time algorithm for finding all nested common intervals. We reduce this complexity by providing an O(n^2) time algorithm computing an irredundant output. Finally, we show, by providing a third algorithm, that fi nding only the maximal nested common intervals can be done in linear time. Considering sequences, we provide solutions (modi cations of previously de ned algorithms and a new algorithm) for di fferent variants of the problem, depending on the treatment one wants to apply to duplicated genes.
Fichier principal
Vignette du fichier
hal.pdf (125.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00620365 , version 1 (22-10-2011)


  • HAL Id : hal-00620365 , version 1


Guillaume Blin, Jens Stoye. Finding Nested Common Intervals Efficiently. 7th RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'09), Sep 2009, Budapest, Hungary. pp.59-69. ⟨hal-00620365⟩
110 View
180 Download


Gmail Facebook Twitter LinkedIn More