Abstract
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.
Extended abstract.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arvind K. Bansal An automated comparative analysis of 17 complete microbial genomes. Bioinformatics, Vol 15, No. 11, p 900–908, (1999).
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.
Thomas Cormen, Charles Leiserson and Ronald Rivest. Introduction to Algorithms. The MIT Press, Cambridge Mass., Eighth Printing, 1028 pages (1992).
Thomas Dandekar, Berend Snel, Martijn Huynen M and Peer Bork. Conservation of gene order: a fingerprint of proteins that physically interact. Trends Biochem Sci, Vol 23, No. 9, p 324–328, (1998).
Wataru Fujibuchi, Hiroyuki Ogata, Hideo Matsuda and Minoru Kanahisa Automatic detection of conserved gene clusters in multiple genomes by graph comparison and P-quasi grouping. Nucleic Acids Research, Vol 28, No. 20, p 4029–4036, (2000).
Steffen Heber and Jens Stoye. Finding all common intervals of k permutations, CPM 01 Proceedings, LNCS 2089, Springer-Verlag, Berlin: 207–218 (2001).
Martijn Huynen, Berend Snel, Warren Lathe III, and Peer Bork Predicting Protein Function by Genomic Context: Quantitative Evaluation and Qualitative Inferences. Genome Research, Vol 10, p 1024–1210, (2000).
Anne Morgat. Synténies bactériennes. Oral presentation, Entretiens Jacques Cartier on Comparative Genomics, Lyon, December 2001.
Hiroyuki Ogata, Wataru Fujibuchi, Susumu Goto and Minoru Kanehisa A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Research, Vol 28, No. 20, p 4021–4028, (2000).
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).
T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290–309, (2000).
Roman L. Tatusov, Michael Y. Galperin, Darren A. Natale and Eugene V. Koonin The COG database: a tool for genome-sacle analysis of protein functions and evolution. Nucleic Acids Research, Vol 28, No. 1, p 33–36, (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergeron, A., Corteel, S., Raffinot, M. (2002). The Algorithmic of Gene Teams. In: Guigó, R., Gusfield, D. (eds) Algorithms in Bioinformatics. WABI 2002. Lecture Notes in Computer Science, vol 2452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45784-4_36
Download citation
DOI: https://doi.org/10.1007/3-540-45784-4_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44211-0
Online ISBN: 978-3-540-45784-8
eBook Packages: Springer Book Archive