Visualizing plant metabolomic correlation networks using clique-metabolite matrices

被引:117
作者
Kose, F
Weckwerth, W
Linke, T
Fiehn, O
机构
[1] Max Planck Inst Mol Plant Physiol, Dept Lothar Wollmitzer, D-14424 Potsdam, Germany
[2] Univ Potsdam, AG Torsten Schaub, Fac Informat, D-14424 Potsdam, Germany
关键词
D O I
10.1093/bioinformatics/17.12.1198
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
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.
引用
收藏
页码:1198 / 1208
页数:11
相关论文
共 32 条
  • [1] [Anonymous], TRAVELING SALESMAN P
  • [2] FINDING MAXIMUM CLIQUES IN ARBITRARY AND IN SPECIAL GRAPHS
    BABEL, L
    [J]. COMPUTING, 1991, 46 (04) : 321 - 341
  • [3] Assessing the accuracy of prediction algorithms for classification: an overview
    Baldi, P
    Brunak, S
    Chauvin, Y
    Andersen, CAF
    Nielsen, H
    [J]. BIOINFORMATICS, 2000, 16 (05) : 412 - 424
  • [4] Data analysis and integration: of steps and arrows
    Bittner, M
    Meltzer, P
    Trent, J
    [J]. NATURE GENETICS, 1999, 22 (03) : 213 - 215
  • [5] FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H]
    BRON, C
    KERBOSCH, J
    [J]. COMMUNICATIONS OF THE ACM, 1973, 16 (09) : 575 - 577
  • [6] AN EXACT ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
    CARRAGHAN, R
    PARDALOS, PM
    [J]. OPERATIONS RESEARCH LETTERS, 1990, 9 (06) : 375 - 382
  • [7] ISOLATION AND CHARACTERIZATION OF AN ARABIDOPSIS MUTANT DEFICIENT IN THE THYLAKOID LIPID DIGALACTOSYL DIACYLGLYCEROL
    DORMANN, P
    HOFFMANNBENNING, S
    BALBO, I
    BENNING, C
    [J]. PLANT CELL, 1995, 7 (11) : 1801 - 1810
  • [8] Identification of uncommon plant metabolites based on calculation of elemental compositions using gas chromatography and quadrupole mass spectrometry
    Fiehn, O
    Kopka, J
    Trethewey, RN
    Willmitzer, L
    [J]. ANALYTICAL CHEMISTRY, 2000, 72 (15) : 3573 - 3580
  • [9] Metabolite profiling for plant functional genomics
    Fiehn, O
    Kopka, J
    Dörmann, P
    Altmann, T
    Trethewey, RN
    Willmitzer, L
    [J]. NATURE BIOTECHNOLOGY, 2000, 18 (11) : 1157 - 1161
  • [10] Integrated studies on plant biology using multiparallel techniques
    Fiehn, O
    Kloska, S
    Altmann, T
    [J]. CURRENT OPINION IN BIOTECHNOLOGY, 2001, 12 (01) : 82 - 86