The Algorithmic of Gene Teams
Comparative genomics is a growing field in computational biology, and one of its typical problem is the identification of sets of orthologous genes that have virtually the same function in several genomes. Many different bioinformatics approaches have been proposed to define these groups, often based on the detection of sets of genes that are “not too far” in all genomes. In this paper, we propose a unifying concept, called gene teams, which can be adapted to various notions of distance. We present two algorithms for identifying gene teams formed by n genes placed on m linear chromosomes. The first one runs in O(m 2 n 2) time, and follows a direct and simple approach. The second one is more tricky, but its running time is O(mnlog2(n)). Both algorithms require linear space. We also discuss extensions to circular chromosomes that achieve the same complexity.
KeywordsTime Complexity Polynomial Algorithm Recursive Call Nucleic Acid Research Circular Chromosome
Unable to display preview. Download preview PDF.
- 2.Tristan Colombo, Alain Guénoche and Yves Quentin, Inférence fonctionnelle par l’analyse du contexte génétique: une application aux transporteurs ABC. Oral presentation, Journées ALBIO, Montpellier, March 2002.Google Scholar
- 3.Thomas Cormen, Charles Leiserson and Ronald Rivest. Introduction to Algorithms. The MIT Press, Cambridge Mass., Eighth Printing, 1028 pages (1992).Google Scholar
- 6.Steffen Heber and Jens Stoye. Finding all common intervals of k permutations, CPM 01 Proceedings, LNCS 2089, Springer-Verlag, Berlin: 207–218 (2001).Google Scholar
- 8.Anne Morgat. Synténies bactériennes. Oral presentation, Entretiens Jacques Cartier on Comparative Genomics, Lyon, December 2001.Google Scholar
- 10.Ross Overbeek, Michael Fonstein, Mark D’souza, Gordon D. Push and Natalia Maltsev The use of gene clusters to infer functional coupling. Proc. Natl. Acad. Sci. USA, Vol 96, p 2896–2901, (1999).Google Scholar