Gecko and GhostFam
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contained in such clusters. For a rigorous and efficient detection in multiple genomes, it is essential to have an appropriate model of gene clusters accompanied by efficient algorithms locating them. The Gecko method described herein was designed to serve as a basic tool for the detection and visualization of gene cluster data in prokaryotic genomes founded on a formal string-based gene cluster model.
Key WordsComparative genomics gene cluster Gecko GhostFam common intervals
The authors wish to thank Christian Rückert and Jörn Kalinowski for their helpful discussions on the topic of gene clusters and their valuable feedback during the development of GhostFam and Gecko.
- 1.Overbeek, R., Fonstein, M., D’Souza, M., Pusch, G. D., and Maltsev, N. (1999) The use of gene clusters to infer functional coupling. Proc. Natl. Acad. Sci. USA 96, 2896–2901.Google Scholar
- 2.Bork, P., Snel, B., Lehmann, G., et al. (2000) Comparative genome analysis: exploiting the context of genes to infer evolution and predict function, in Comparative Genomics, (Sankoff, D. and Nadeau, J. H., eds.), Kluwer Academic Publishers, pp. 281–294.Google Scholar
- 6.Yanai, I. and DeLisi, C. (2002) The society of genes: networks of functional links between genes from comparative genomics. Genome Biol. 3, 1–12.Google Scholar
- 10.Schmidt, T., and Stoye, J. (2004) Quadratic time algorithms for finding common intervals in two and more sequences, in Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004, volume 3109 of LNCS, Springer Verlag, pp. 347–358.Google Scholar
- 11.Schmidt, T. (2005) Efficient Algorithms for Gene Cluster Detection in Prokaryotic Genomes. Dissertation, Technische Fakultät der Universität Bielefeld, Bielefeld, 2005. Available at http://bieson.ub.uni-bielefeld.de/volltexte/2005/749/.
- 14.Heber, S. and Stoye, J. (2001) Finding all common intervals of k permutations, in Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001, pp. 207–218.Google Scholar
- 16.Bergeron, A., Corteel, S., and Raffinot, M. (2002) The algorithmic of gene teams, in Proceedings of the Second International Workshop on Algorithms in BioInformatics, WABI2002, pp. 464–476.Google Scholar
- 17.Amir, A., Apostolico, A., Landau, G. M., and Satta, G. (2003) Efficient text fingerprinting via parikh mapping. J. Discr. Alg. 26, 1–13.Google Scholar