Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
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 ISI Web of Science
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 arrow Search for citing articles in:
ISI Web of Science (33)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kose, F.
Right arrow Articles by Fiehn, O.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Kose, F.
Right arrow Articles by Fiehn, O.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 12 2001
Pages 1198-1208
© 2001 Oxford University Press

Visualizing plant metabolomic correlation networks using clique–metabolite matrices

Frank Kose 1,*, Wolfram Weckwerth 1, Thomas Linke 2 and Oliver Fiehn 1

1 Max Planck Institute of Molecular Plant Physiology, Department of Lothar Willmitzer, Postfach, 14424 Potsdam, Germany
2 University of Potsdam, Faculty of Informatics, AG Torsten Schaub, 14424 Potsdam, Germany

Received on September 1, 2000 ; revised on May 24, 2001 ; accepted on June 26, 2001

Motivation: Today, metabolite levels in biological samples can be determined using multiparallel, fast, and precise metabolomic approaches. Correlations between the levels of various metabolites can be searched to gain information about metabolic links. Such correlations are the net result of direct enzymatic conversions and of indirect cellular regulation over transcriptional or biochemical processes. In order to visualize metabolic networks derived from correlation lists graphically, each metabolite pair may be represented as vertices connected by an edge. However, graph complexity rapidly increases with the number of edges and vertices. To gain structural information from metabolite correlation networks, improvements in clarity are needed.

Results: To achieve this clarity, three algorithms are combined. First, a list of linear metabolite correlations is generated that can be regarded as a set of pairs of edges (or as 2-cliques). Next, a branch-and-bound algorithm was developed to find all maximal cliques by combining submaximal cliques. Due to a clique assignment procedure, the generation of unnecessary submaximal cliques is avoided in order to maintain high efficiency. Differences and similarities to the Bron–Kerbosch algorithm are pointed out. Lastly, metabolite correlation networks are visualized by clique–metabolite matrices that are sorted to minimize the length of lines that connect different cliques and metabolites. Examples of biochemical hypotheses are given that can be built from interpretation of such clique matrices.

Availability: The algorithms are implemented in Visual Basic and can be downloaded from our web site along with a test data set (http://www.mpimp-golm.mpg.de/fiehn/projekte/data-mining-e.html).

Contact: kose{at}mpimp-golm.mpg.de

* To whom correspondence should be addressed.


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
Brief BioinformHome page
R. Steuer
Review: On the analysis and interpretation of correlations in metabolomic data
Brief Bioinform, June 1, 2006; 7(2): 151 - 158.
[Abstract] [Full Text] [PDF]


Home page
J. Nutr.Home page
Y. Noguchi, R. Sakai, and T. Kimura
Metabolomics and its Potential for Assessment of Adequacy and Safety of Amino Acid Intake
J. Nutr., June 1, 2003; 133(6): 2097S - 2100.
[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.