Common Intervals of Two Sequences
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.
KeywordsLinear Time Gene Order Binary Search Paralog Gene Tree Representation
Unable to display preview. Download preview PDF.
- 1.Amir, A., Apostolico, A., Landau, G., Satta, G.: Efficient Text Fingerprinting Via Parikh Mapping, Journal of Discrete Algorithms (to appear)Google Scholar
- 2.Bergeron, A., Heber, S., Stoye, J.: Common intervals and sorting by reversals: a marriage of necessity. In: ECCB 2002, pp. 54–63 (2002)Google Scholar