Common Intervals of Two Sequences

Conference Paper · September 2003with7 Reads
DOI: 10.1007/978-3-540-39763-2_2 · Source: DBLP
Conference: Algorithms in Bioinformatics, Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings


    Looking for the subsets of genes appearing consecutively in two or more genomes is an useful approach to identify clusters
    of genes functionally associated. A possible formalization of this problem is to modelize the order in which the genes appear
    in all the considered genomes as permutations of their order in the first genome and find k-tuples of contiguous subsets of these permutations consisting of the same elements: the common intervals. A drawback of this
    approach is that it doesn’t allow to take into account paralog genes and genomic internal duplications (each element occurs
    only once in a permutation). To do it we need to modelize the order of genes by sequences which are not necessary permutations.

    In this work, we study some properties of common intervals between two general sequences. We bound the maximum number of common
    intervals between two sequences of length n by n
    2 and present an O(n
    2log(n)) time complexity algorithm to enumerate their whole set of common intervals. This complexity does not depend on the size
    of the alphabets of the sequences.