Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amir, A., Apostolico, A., Landau, G., Satta, G.: Efficient Text Fingerprinting Via Parikh Mapping, Journal of Discrete Algorithms (to appear)
Bergeron, A., Heber, S., Stoye, J.: Common intervals and sorting by reversals: a marriage of necessity. In: ECCB 2002, pp. 54–63 (2002)
Dandekar, T., Snel, B., Huynen, M., Bork, P.: Conservation of gene order: A fingerprint of proteins that physically interact. Trends Biochem. Sci. 23, 324–328 (1998)
Heber, S., Stoye, J.: Finding All Common Intervals of k Permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 207–218. Springer, Heidelberg (2001)
Heber, S., Stoye, J.: Algorithms for Finding Gene Clusters. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 252–263. Springer, Heidelberg (2001)
Mushegian, R., Koonin, E.V.: Gene order is not conserved in bacterial evolution. Trends Genet. 12, 289–290 (1996)
Tamames, J., Gonzales-Moreno, M., Mingorance, J., Valencia, A.: Conserved clusters of functionally related genes in two bacterial genomes. J. Mol. Evol. 44, 66–73 (1996)
Uno, T., Yagira, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290–309 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Didier, G. (2003). Common Intervals of Two Sequences. In: Benson, G., Page, R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science(), vol 2812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39763-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-39763-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20076-5
Online ISBN: 978-3-540-39763-2
eBook Packages: Springer Book Archive