Computation of Median Gene Clusters

  • Sebastian Böcker
  • Katharina Jahn
  • Julia Mixtacki
  • Jens Stoye
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4955)


Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of genes that occur co-localized in several genomes. For most applications it is preferable to extend this definition to allow for small deviations in the gene content of the cluster occurrences. However, relaxing the equality constraint increases the computational complexity of gene cluster detection drastically. Existing approaches deal with this problem by using simplifying constraints on the cluster definition and/or allowing only pairwise genome comparison. In this paper we introduce a cluster concept named median gene clusters that improves over existing models and present efficient algorithms for their computation that allow for the detection of approximate gene clusters in multiple genomes.


Gene Cluster Gene Order Reference Interval Marked Interval Left Border 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amir, A., Gasieniec, L., Shalom, R.: Improved approximate common interval. Inf. Process. Lett. 103(4), 142–149 (2007)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Bergeron, A., Chauve, C., de Mongolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 779–790. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 464–476. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Chauve, C., Diekmann, Y., Heber, S., Mixtacki, J., Rahmann, S., Stoye, J.: On common intervals with errors. Report 2006-02, Technische Fakultät der Universität Bielefeld, Abteilung Informationstechnik (2006)Google Scholar
  5. 5.
    Dandekar, T., Snel, B., Huynen, M., Bork, P.: Conservation of gene order: a fingerprint of proteins that physically interact. Trends Biochem. Sci. 23(9), 324–328 (1998)CrossRefGoogle Scholar
  6. 6.
    Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings. J. Discr. Alg. 5, 330–340 (2007)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Frances, M., Litman, A.: On covering problems of codes. Theor. Comput. Sci. 30, 119–133 (1997)MathSciNetGoogle Scholar
  8. 8.
    Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25–42 (2003)CrossRefMathSciNetzbMATHGoogle Scholar
  9. 9.
    He, X., Goldwasser, M.H.: Identifying conserved gene clusters in the presence of homology families. J. Comp. Biol. 12, 638–656 (2005)CrossRefGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Hoberman, R., Durand, D.: The incompatible desiderata of gene cluster properties. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3678, pp. 73–87. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Rahmann, S., Klau, G.W.: Integer linear programs for discovering approximate gene clusters. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 298–309. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Schmidt, T., Stoye, J.: Quadratic time algorithms for finding common intervals in two and more sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 347–358. Springer, Heidelberg (2004)Google Scholar
  15. 15.
    Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26, 290–309 (2000)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sebastian Böcker
    • 1
  • Katharina Jahn
    • 2
  • Julia Mixtacki
    • 2
  • Jens Stoye
    • 3
  1. 1.Institut für InformatikFriedrich-Schiller-Universität JenaGermany
  2. 2.International NRW Graduate School in Bioinformatics and Genome ResearchUniversität BielefeldGermany
  3. 3.Technische FakultätUniversität BielefeldGermany

Personalised recommendations