Skip Navigation



Bioinformatics Advance Access published online on October 10, 2005
Bioinformatics, doi:10.1093/bioinformatics/bti711
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
21/23/4209    most recent
bti711v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Boyer, F.
Right arrow Articles by Viari, A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Boyer, F.
Right arrow Articles by Viari, A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2005). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received June 1, 2005
Revised July 22, 2005
Accepted October 6, 2005

Article

Syntons, metabolons and interactons: an exact graph-theoretical approach for exploring neighbourhood between genomic and functional data

Frédéric Boyer 1, Anne Morgat 2, Laurent Labarre 3, Joël Pothier 4, and Alain Viari 1*

1 INRIA Rhône-Alpes - HELIX Group - 655, avenue de l'Europe - 38334 Montbonnot Cedex, France
2 Swiss Institute of Bioinformatics - Swiss-Prot Group - 1, rue Michel Servet - CH-1211, Geneva, Switzerland
3 UMR 8030 - Genoscope - Centre National de Séquençage - 2, rue Gaston Crémieux CP5706 - 91057 Evry cedex, France
4 Atelier de BioInformatique - Université Paris VI - 12, rue Cuvier - 75005 Paris, France

* To whom correspondence should be addressed.
Alain Viari, E-mail: Alain.Viari{at}inrialpes.fr


  Abstract

Motivation: Modern comparative genomics does not restrict to sequence but involve the comparison of metabolic pathways or protein-protein interaction as well. Central in this approach is the concept of neighbourhood between entities (genes, proteins, chemical compounds). Therefore there is a growing need for new methods aiming at merging the connectivity information from different biological sources in order to infer functional coupling.

Results: We present a generic approach to merge the information from two or more graphs representing biological data. The method is based on two concepts. The first one, the correspondence multigraph, precisely defines how the correspondence is performed between the primary data-graphs. The second one, the common connected components, defines which property of the multigraph is searched for. Although this problem has already been informally stated in the past few years, we give here a formal and general statement together with an exact algorithm to solve it.

Availability: The algorithm presented in this paper has been implemented in C. Source code is freely available for download at: http://www.inrialpes.fr/helix/people/viari/cccpart.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Nucleic Acids ResHome page
P. Lechat, L. Hummel, S. Rousseau, and I. Moszer
GenoList: an integrated environment for comparative analysis of microbial genomes
Nucleic Acids Res., January 11, 2008; 36(suppl_1): D469 - D474.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
D. Vallenet, L. Labarre, Z. Rouy, V. Barbe, S. Bocs, S. Cruveiller, A. Lajus, G. Pascal, C. Scarpelli, and C. Medigue
MaGe: a microbial genome annotation system supported by synteny results
Nucleic Acids Res., January 10, 2006; 34(1): 53 - 65.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.