Finding Nested Common Intervals Efficiently

  • Authors:
  • Guillaume Blin;Jens Stoye

  • Affiliations:
  • Université Paris-Est, LIGM - UMR CNRS 8049, France;Technische Fakultät, Universität Bielefeld, Germany

  • Venue:
  • RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the problem of efficiently finding 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 finding only the maximal nested common intervals can be done in linear time. Considering sequences, we provide solutions (modifications of previously defined algorithms and a new algorithm) for different variants of the problem, depending on the treatment one wants to apply to duplicated genes.