Skip to main content

Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks



To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to calculate the distance between the resulting values of each measure. Conventional phylogenetic analysis based on genomic sequences provides information about the genetic relationships between different organisms. In contrast, comparative analysis of metabolic pathways in different organisms can yield insights into their functional relationships under different physiological conditions. However, evaluating the similarities or differences between metabolic networks is a computationally challenging problem, and systematic methods of doing this are desirable. Here we introduce a graph-kernel method for computing the similarity between metabolic networks in polynomial time, and use it to profile metabolic pathways and to construct phylogenetic trees.


To compare the structures of metabolic networks in organisms, we adopted the exponential graph kernel, which is a kernel-based approach with a labeled graph that includes a label matrix and an adjacency matrix. To construct the phylogenetic trees, we used an unweighted pair-group method with arithmetic mean, i.e., a hierarchical clustering algorithm. We applied the kernel-based network profiling method in a comparative analysis of nine carbohydrate metabolic networks from 81 biological species encompassing Archaea, Eukaryota, and Eubacteria. The resulting phylogenetic hierarchies generally support the tripartite scheme of three domains rather than the two domains of prokaryotes and eukaryotes.


By combining the kernel machines with metabolic information, the method infers the context of biosphere development that covers physiological events required for adaptation by genetic reconstruction. The results show that one may obtain a global view of the tree of life by comparing the metabolic pathway structures using meta-level information rather than sequence information. This method may yield further information about biological evolution, such as the history of horizontal transfer of each gene, by studying the detailed structure of the phylogenetic tree constructed by the kernel-based method.


The availability of pathway databases such as Kyoto Encyclopedia of Genes and Genomes (KEGG), What is there? (WIT3), PathDB, and MetaCyc opens up various new possibilities for comparative analysis. In particular, information about metabolic pathways in different organisms yields important information about their evolution and offers a complementary approach to phylogenetic analysis. Here we present a comparative metabolomic approach to constructing phylogenetic trees that uses physiological functions of the organisms by computing the structural similarity of metabolic networks. The consideration of metabolic components complements the conventional approaches to phylogeny based on genome sequences. Recognizing the similarities and differences in metabolic functions between species may provide insights into other applications in biotechnology, ecology, and evolutionary studies. Several researchers have attempted to rebuild evolutionary history by comparing ribosomal RNA sequences [1], by phylogenomics [2], or by comparing whole genomes to overcome the limitations of the gene-sequence analyses [35].

Several recent studies have extended conventional phylogenetic analysis to incorporate metabolic pathway information. Forst and Schulten [6, 7] presented one of the earliest approaches to extend the conventional sequence comparison and phylogenetic analysis of individual enzymes to metabolic networks. They also presented a method to calculate distances between metabolic networks based on sequence information of the biomolecules involved and information about the corresponding reaction networks. Dandekar et al. (1999) combined strategies in a systematic comparison of the enzymes and corresponding sequence information of the glycolytic pathway [8]. Other approaches involving the reconstructed phylogenies from gene-order data have been based on simulating genome evolution [9], and studying the genome evolution resulting from the metabolic adaptation of the organism to the surrounding environment. Liao et al. (2002) presented a method to group organisms by comparing the profiles of metabolic pathways, where the profiling was based simply on binary attributes (e.g., by denoting the presence or absence of pathways in the organisms) [10].

Whereas the previous approaches incorporated information about the additional metabolic pathways, systematic methods to calculate the similarities between metabolic networks are lacking or contain gaps in some of the biological assumptions. In this paper, we introduce the concept of graph kernels to calculate the similarities between two different network structures. The graph kernel-based approach can compute more efficiently the similarity of two graph structures by the kernel function that can extract important features from the graph. Our approach contrasts with that of Forst and Schulten [6, 7] in that the graph kernel calculates the distance based on the network level instead of on its sequence information on the biomolecules involved.

In their comparative analysis of metabolic pathways, Heymans and Singh [11] showed that phylogenetic trees could be made from the graph similarities of metabolic networks. They applied a distance measure between metabolic graphs of the glycolytic pathway and the citric acid cycle from 16 organisms. However, some of their data on phylogenetic inference did not correspond entirely with the conventional taxonomy and did not provide a global view of the specialization of species according to the scale of analyzed species and metabolic pathways.

Several more recent attempts have reconstructed genome trees using different formalisms such as gene ordering [12, 13], measuring gene contents [3, 14], comparing sequence similarities [15, 16], comparing proteome strings [17], and phylogenomics [18, 19]. All are based on the principle of genome sequences, but none has applied the concepts of effectible physiology to the phylogenetic analyses. We report on our comparative results and discuss our findings.

Results and discussion

We chose nine pathways of carbohydrate metabolism and 81 species to perform a comparative analysis of metabolic networks that satisfied the most abundant dataset from KEGG (Table 1, 2 and 3). Our sample comprised 13 species of Archaea, eight species of Eukaryota, and 60 species of Eubacteria. The central pathways of metabolism include the glycolytic and pentose phosphate pathways, and the citric acid cycle, which generate biological energy and form the metabolic precursors essential for almost all living cells. To validate the data, we investigated the distribution of each enzyme in the nine pathways. Several enzymes appear at a high frequency in all species, and this frequency decreases rather exponentially as the value of x-axis increases (Figure 1), a phenomenon we observed in all pathways studied. Because the characteristics of the enzyme distribution did not differ, all pathways can be used in the phylogenetic analysis. We observed no obvious tendency of shift or deviation of the distributions from the overall pattern of pathways.

Table 1 Statistics for the dataset according to the number of enzymes and their relationships
Table 2 The nine reference pathways used in the analysis
Table 3 The 81 organisms included in the phylogenetic analysis. Full scientific names were abbreviated into three character notation (Abbr.) and their domain informations in phylogeny were also represented in single character that are Eubacteria (B), Archaea (A) and Eukaryota (E), respectively.
Figure 1
figure 1

The distribution of enzymes in nine reference pathways. The x axis is the index of the maximum value of the order sorted by the frequency of enzyme over all pathways. All plots showed similar distributions.

The phylogeny took two directions: conventional taxonomy that focused on the morphological and physiological features to classify species, and a numerical taxonomy that stressed the historical changes in biological sequences. Phylogenies based on the ribosomal RNA molecules led to the proposal of a new tripartite scheme of three domains: Bacteria, Archaea, and Eukarya [20]. Although each approach is feasible on its own, it cannot provide a holistic view of the organism. Current phylogenetic studies indicate that horizontal gene transfer may have played a vital role in the evolution of major lineages [21]. Lake and Moore [22] also noted the pitfalls of comparative genomics based on molecular sequences. Our kernel-based method provides an alternative to the inference of an evolutionary scenario and allows for a higher-level comparison of the phylogenetic trees by measuring the distances between pathways using metabolic network data to infer an evolutionary scenario.

Consistency with conventional taxonomy

Figure 2 compares the phylogenetic tree constructed by the kernel method using (a) metabolic networks, and (b) by the sequence-based analysis of phosphoglycerate kinase and phosphopyruvate hydratase. The overall tree structure appears to be consistent with the current classification of the three domains, Eubacteria, Archaea, and Eukaryota (Figure 3). In the domain of Archaea, methanogens such as Methanosarcina, Methanococcus, and Methanobacterium are clustered in the early branch of Pyrococcus. Five thermophiles are also clustered in the same branch with a halophile, Halobacterium. The structure of collective carbohydrate pathways from Arabidopsis thaliana has the smallest distance from yeasts (Figure 2). As shown in Figure 2(a), the kernel-based method branches at the levels of family (Enterobacteriaceae), order (Bacillales), and class (Gammaproteobacterium) according to similar metabolic network structures. Figures 2(a) and 3 show that the domain of Archaea corresponded largely to that of conventional taxonomy; NCBI Taxonomy Browser). In Eukaryota, only the mouse deviated from the taxonomy consensus. Typically, the domain of Archaea always formed a single cluster in every case in our experiments, suggesting that the domain of Archaea has peculiar characteristics, at least in the carbohydrate metabolic networks. We conclude that the metabolic structure in Archaea is distinct from that of the other two domains.

Figure 2
figure 2

Comparison of phylogenetic trees constructed using (a) the kernel-based method and (b) the alignments of the following two enzyme sequences, together: phosphoglycerate kinase (EC and phosphopyruvate hydratase (EC The amino acid sequences of corresponding enzymes were retrieved from the GenBank database and analyzed by CLUSTAL with default parameters. The resultant trees were viewed with the TREEVIEW program [43].

Figure 3
figure 3

Current classification of biological taxonomy. The tree was reconstructed from part of the data in the NCBI (National Center for Biotechnology Information) Taxonomy [44] and viewed with the TREEVIEW program [43].

Figure 2(a) shows that archaeal metabolic networks are more closely related to the eukaryotic networks than with the eubacterial networks. This corresponds with a comparison of the information-transfer pathways and pathway-level organization between two domains [23], whereas eukaryotic metabolic enzymes are primarily of bacterial origin [24].

Inferring hidden order by network clustering

The conventional sequence-based analysis passes over or does not embrace the discordant evolution of each species or the horizontal gene transfer [25]. Our method can cope with this limitation by taking into account the structural features of individual metabolic networks. The disagreement between the molecular sequence data of operational genes and the rRNA tree suggests that different genes have different evolutionary histories [26, 27]. To address this problem, Li studied the mitochondrial genomes in relation to the problem of whole-genome phylogeny, where evolutionary events, such as genetic rearrangements that include gene transfer from the exterior, make genome alignments difficult [28].

To compare the kernel-based comparative analysis of metabolic networks to the sequence-based phylogenetic analysis, we analyzed two enzyme sequences that participate in carbohydrate metabolism in all 81 species together using a multiple sequence alignment (Figure 2(b)). In the resulting phylogenetic tree, Archaea and Eukaryota are clustered at each terminal; however, short-distance neighboring node members belong to fairly distant taxonomic groups. The overall structure of the tree eventually becomes remote from not only that of the kernel-based method (Figure 2(a)), but also from that of current taxonomy (Figure 3). Although the phylogenetic tree constructed from the multiple alignment of two enzyme sequences shows a few unusual characteristics, our approach provides a good solution. The cluster mainly comprised archaeal species including the bacterial members Chlamydia and Chlamydophila, and had long branches at the root of the tree. Three eubacterial members (Ana, Tel, and Syn) are more closely related to Eukaryota than Eubacteria. Moreover, eubacterial groups are separated over the topology, and the Eukaryota are inserted between them (Figure 2(b)).

This result shows an example of the sequence-based phylogenetic approach when we intend to perform phylogenetic analyses for as many species as possible. The sequence-based phylogenetic analysis can fail to precisely represent evolutionary history without an analysis using a set of whole sequences. Unfortunately, analyses using whole sequences require massive computing power and are highly complex. A sequence-based phylogenetic analysis can still be limited to cover a number of species, although alternative approaches exist. However, our method can easily solve this problem by utilizing given resources. In order to measure the quality of our constructed trees, we compared the phylogenetic tree based on our graph kernel method with that of Heymans and Singh [11] in terms of their similarity to conventional taxonomy. We used a software tool, 'Cousins' [31], which compares two alternative phylogenetic trees based on common cousin pairs in the trees. The comparison by cousin pairs is said to more focus on local similarity between two trees because it evaluates the similarity based on a cousin pair within a certain degree. Table 4 shows the similarity score of our kernel-based method in comparison with [11] for the glycolysis pathways of 65 organisms. Our method shows a better result in terms of the similarity score with the conventional NCBI taxonomy.

Table 4 Comparison of similarity scores with respect to NCBI taxonomy for 65 organisms with the glycolysis pathway (β = 0.8).

In this paper, we intended to present a meta-level analysis of biological systems to construct a unitary phylogenetic tree that could be used to interpret the context of biological evolution. Our results suggest that the phylogenetic analysis with submetabolic network information might also allow us to infer horizontal or lateral gene transfer. Our results also support the tripartite scheme of the three domains, Bacteria, Archaea and Eukaryota [20].

Comparing the pathogenic bacterial genomes by focusing on the pathways of bacterial and eukaryotic aminoacyl-tRNA synthesis showed that this pathway is uniquely prokaryotic/archaeal and that it is found widely among the pathogenic bacteria. This suggests that members of this pathway can be used as targets for novel antimicrobial drugs [32]. Metabolic analysis of pathogenic organisms may play a critical role in the selective treatment or prevention of diseases caused by these organisms by using this innovative concept to develop new drugs.


Biological classification, taxonomy, and systematics are the profound themes in biology. Using phylogeny in evolutionary classification implies functional and morphological innovation, adaptive range, parallelism, and convergence. We have used a method based on the graph kernel to compare information on each metabolic network including cardinality, distance, and topology relating to metabolic networks as a type of undirected graph. Our results showed that our approach has potential in the macroscopic analysis of phylogenetic relationships among organisms in relation to horizontal gene transfer. To obtain information about each causal mechanism in the context of a similar phenotype, one should first analyze the phenomena at the level of a protein network. The analysis of a metabolic network is an example of this type of analysis. Biological entities that interact with the environment and eventually influence adaptation are a function of the activity of proteins and other bioactive molecules rather than gene order or genetic history.

The overall structure of the phylogenetic tree constructed from our experiments supports the tripartite scheme of the three domains Archaea, Eubacteria, and Eukaryota as described in an early report of Woese et al. [20]. The structures of metabolic pathway deduced from Archaea are more similar to those from Eukaryota than to those from Eubacteria. This agrees with the rooted universal tree of life [33, 34] and the tree of life [35, 36]. The metabolic network structures of organisms reflect their functional relationship with the environment, and the similarity might provide a measure of the organism's physiological functions. The trajectory of an organism's adaptation can be explained using the structure of its metabolic contents. Our approach can be extended to more organisms and applied to other types of biomolecular interactions, such as physical protein interactions in regulatory networks, to provide a basis for understanding the functional relationships between biological networks in different organisms.


We attempt to cluster organisms by comparing sets of metabolic pathways. Our basic assumption is that different species exhibit overlapping components of metabolic pathways. To construct phylogenetic trees, the features of the organism-specific pathways are automatically extracted by considering the reference pathway. Here, the features represent the connection information between two enzymes. Figure 4 summarizes the procedure for the phylogenetic clustering of organisms by metabolic pathways using four steps:

Figure 4
figure 4

The procedure for data processing for phylogenetic tree construction from the metabolic networks.

  • Step 1: Build the enzyme-enzyme relation lists.

  • Step 2: Convert the lists to graph structures.

  • Step 3: Compute similarity by graph kernels.

  • Step 4: Build the phylogenetic trees.

We evaluated this method using known experimental data on a collection of nine metabolic pathways from 81 representative organisms. Figure 5 shows the simple concept used to compute the distance between two metabolic networks. The resulting phylogenetic trees were cross-compared for consistency with existing methods to analyze phylogenies. The next section describes the datasets collected and the preparation methods, followed by the definition of graph kernels and their use in comparing and clustering metabolic networks for phylogenetic analysis.

Figure 5
figure 5

The simple concept for computing the similarity between two metabolic networks using the kernel method.

Data preparation


We chose the KEGG database [37] as the resource for previous phylogenetic analysis. KEGG provides both an online map of pathways and the ability to focus on metabolic reactions in specific organisms. Each reaction may be uni- or bidirectional.

Representation of organisms

Let O = {O1,..., O N } be a set of N organisms and P = {P1,..., P M } be a set of M reference pathways. Here a reference pathway contains all known alternatives of reaction paths. The set of organism-specific pathways is defined as P' = { P 1 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGqbaugaqbamaaBaaaleaacqaIXaqmaeqaaaaa@2EFD@ ,..., P M MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGqbaugaqbamaaBaaaleaacqWGnbqtaeqaaaaa@2F30@ }, which contains organism-specific reactions. If we define a set of enzyme-enzyme relations as R = {r1,...,r K }, then a subset of R constitutes P j or P j MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGqbaugaqbamaaBaaaleaacqWGQbGAaeqaaaaa@2F6A@ (1 ≤ jM). Here, r k (1 ≤ kK) is a pair of enzymes {e u , e v }, which means that e u directly connects with e v . The specific organism O i (1 ≤ iN) contains a set of pathways P, defined as P'(O i ) and including a subset of R for the specific organism, R'(O i ).

Enzyme-enzyme relation lists of organisms

The pathways provided in KEGG are visualized on manually drawn pathway maps or XML-based graphics. To construct enzyme-enzyme relation lists, we used information about chemical compounds and chemical reactions contained in the LIGAND database [38]. The LIGAND database provides detailed molecular information about one type of the generalized protein-protein interaction, namely, the enzyme-enzyme relation. LIGAND is a composite database of ENZYME and COMPOUND. The ENZYME section contains information about enzymatic reactions and enzyme molecules, and the COMPOUND section contains more than 6,000 chemical compounds. The enzyme-enzyme relationship can be extracted from information about enzymes contained in the COMPOUND entries. We automatically extracted information about enzymes of a specific organism from the ENZYME section.

The enzyme-enzyme relationships of a specific organism were extracted from the enzyme-enzyme relation list. If two enzymes of r k in an enzyme-enzyme relation list existed in the enzyme list of a specific organism, we inserted r k into R'(O i ). P'(O i ) can be constructed by R'(O i ).

Data analysis

Metabolic networks as labeled graphs

Our approach to estimate the distance between two metabolic networks is based on the graph comparison. Using the relation list of enzymes, the metabolic network of each organism is represented by a labeled graph Γ = ( V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ , MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFWesraaa@3785@ , f), where V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ is a vertex set and MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFWesraaa@3785@ is an edge set. f is a vertex-labeling function f: V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFsectaaa@376E@ , where MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFsectaaa@376E@ = {ℓ l } is a set of possible labels for vertices.

For an organism O i , each vertex v V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i corresponds to an enzyme of O i , and the cardinality | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i | is equal to the number of distinct enzymes in the enzyme-enzyme relation list R(O i ) of the organism. When an entry for two enzymes e u and e v is found in R(O i ), the corresponding vertices u and v are directly connected by an edge (u, v) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFWesraaa@3785@ i (denoted by u ~ v). The set MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFsectaaa@376E@ contains the unique identifiers (i.e., EC numbers) of all enzymes found in { R ( O i ) } i = 1 N MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaGadaqaaiabdkfasnaabmaabaGaem4ta80aaSbaaSqaaiabdMgaPbqabaaakiaawIcacaGLPaaaaiaawUhacaGL9baadaqhaaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOta4eaaaaa@38EE@ of all selected organisms.

A matrix representation of a labeled graph Γ i can be given by an adjacency matrix H i and a label matrix L i and, where H i is a | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i | × | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i | square matrix and L i is a | MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFsectaaa@376E@ | × | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i | matrix. Each element H i (a, b) is given by

H i ( a , b ) = { w ( v a , v b ) if  v a v b 0 otherwise ( 1 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGibasdaWgaaWcbaGaemyAaKgabeaakmaabmaabaGaemyyaeMaeiilaWIaemOyaigacaGLOaGaayzkaaGaeyypa0ZaaiqaaeaafaqabeGacaaabaGaem4DaC3aaSbaaSqaaiabcIcaOiabdAha2naaBaaameaacqWGHbqyaeqaaSGaeiilaWIaemODay3aaSbaaWqaaiabdkgaIbqabaWccqGGPaqkaeqaaaGcbaGaeeyAaKMaeeOzayMaeeiiaaIaemODay3aaSbaaSqaaiabdggaHbqabaGccqWI8iIocqWG2bGDdaWgaaWcbaGaemOyaigabeaaaOqaaiabicdaWaqaaiabb+gaVjabbsha0jabbIgaOjabbwgaLjabbkhaYjabbEha3jabbMgaPjabbohaZjabbwgaLbaaaiaawUhaaiaaxMaacaWLjaWaaeWaaeaacqaIXaqmaiaawIcacaGLPaaaaaa@5C60@

where w ( v a , v b ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWG3bWDdaWgaaWcbaGaeiikaGIaemODay3aaSbaaWqaaiabdggaHbqabaWccqGGSaalcqWG2bGDdaWgaaadbaGaemOyaigabeaaliabcMcaPaqabaaaaa@36D3@ is the weight of the edge (v a , v b ). Whenever the vertices v a and v b are joined by an edge, we set the weight such that w(v a , v b ) = C Γ i 1 d e g ( v a ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGdbWqdaWgaaWcbaGaeu4KdC0aaSbaaWqaaiabdMgaPbqabaaaleqaaOGaeyyXIC9aaSaaaeaacqaIXaqmaeaaieGacqWFKbazcqWFLbqzcqWFNbWzcqGGOaakcqWG2bGDdaWgaaWcbaGaemyyaegabeaakiabcMcaPaaaaaa@3CD8@ , where deg(v a ) is the degree of v a and C Γ i MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGdbWqdaWgaaWcbaGaeu4KdC0aaSbaaWqaaiabdMgaPbqabaaaleqaaaaa@30E2@ is a constant for the graph Γ i . Then, w(v a , v b ) can be thought to be proportional to a probability (1/deg(v a )) to visit v b in one step in a random walk starting from v a . We set C Γ i = v V i d e g ( v ) | V i | MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaacqWGdbWqdaWgaaWcbaGaeu4KdC0aaSbaaWqaaiabdMgaPbqabaaaleqaaOGaeyypa0ZaaSaaaeaadaaeqaqaaGqaciab=rgaKjab=vgaLjab=DgaNjabcIcaOiabdAha2jabcMcaPaWcbaGaemODayNaeyicI4mcdaGae4xfXB1aaSbaaWqaaiab=LgaPbqabaaaleqaniabggHiLdaakeaacqGG8baFcqGFveVvdaWgaaWcbaGae8xAaKgabeaakiabcYha8baaaaa@51A3@ , which makes H i such that its total sum of elemets is still same to the number of edges in a bidirectional representation of Γ i .

An element of the matrix L i defined as

L i ( l , a ) = { 1 if  l = f ( v a ) , 0 otherwise . ( 2 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGmbatdaWgaaWcbaGaemyAaKgabeaakiabcIcaOiabdYgaSjabcYcaSiabdggaHjabcMcaPiabg2da9maaceaabaqbaeaabiGaaaqaaiabigdaXaqaaiabbMgaPjabbAgaMjabbccaGiabloriSnaaBaaaleaacqWGSbaBaeqaaOGaeyypa0JaemOzayMaeiikaGIaemODay3aaSbaaSqaaiabdggaHbqabaGccqGGPaqkcqGGSaalaeaacqaIWaamaeaacqqGVbWBcqqG0baDcqqGObaAcqqGLbqzcqqGYbGCcqqG3bWDcqqGPbqAcqqGZbWCcqqGLbqzcqGGUaGlaaaacaGL7baacaWLjaGaaCzcamaabmaabaGaeGOmaidacaGLOaGaayzkaaaaaa@57DD@

with 1 ≤ l ≤ | MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFsectaaa@376E@ |, 1 ≤ a ≤ | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i |. This means that L i (l, a) is 1 only when the label of vertex v a is ℓ l . Since we represent a metabolic pathway in such a way that every vertex (enzyme) in it has a unique EC number, every column sum of L i is 1, that is, ∑ l L i (l, a) = 1, ( a). And, in terms of rows of L, ∑ a L i (l, a) = 1 if ℓ l = f(v) ( v V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i ); ∑ a L i (l, a) = 0 otherwise. To compare the structures between metabolic networks of two organisms represented in graphs as described above, we adopted a kernel-based approach called the exponential graph kernel [39].

Comparison of metabolic networks: graph kernel

Given two graphs Γ i = (L i , H i ) and Γ j = (L j , H j ), the first simple approach to the graph comparison is to count the common vertices with the same labels in both Γ i and Γ j . This similarity (or kernel) can be calculated by k i , Γ j ) = < L i L i T MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGmbatdaWgaaWcbaGaemyAaKgabeaakiabdYeamnaaDaaaleaacqWGPbqAaeaacqWGubavaaaaaa@3338@ , L j L j T MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGmbatdaWgaaWcbaGaemOAaOgabeaakiabdYeamnaaDaaaleaacqWGQbGAaeaacqWGubavaaaaaa@333C@ >, where the inner product <M i , M j > between two matrices of the same dimension is defined as

M i , M j = a b M i ( a , b ) × M j ( a , b ) . ( 3 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqGHPms4cqWGnbqtdaWgaaWcbaGaemyAaKgabeaakiabcYcaSiabd2eannaaBaaaleaacqWGQbGAaeqaaOGaeyOkJeVaeyypa0Zaaabuaeaadaaeqbqaaiabd2eannaaBaaaleaacqWGPbqAaeqaaOGaeiikaGIaemyyaeMaeiilaWIaemOyaiMaeiykaKIaey41aqRaemyta00aaSbaaSqaaiabdQgaQbqabaGccqGGOaakcqWGHbqycqGGSaalcqWGIbGycqGGPaqkaSqaaiabdkgaIbqab0GaeyyeIuoaaSqaaiabdggaHbqab0GaeyyeIuoakiabc6caUiaaxMaacaWLjaWaaeWaaeaacqaIZaWmaiaawIcacaGLPaaaaaa@54E1@

Based on the definition of the label matrix in Equation (2), the matrix M i = L i L i T MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGmbatdaWgaaWcbaGaemyAaKgabeaakiabdYeamnaaDaaaleaacqWGPbqAaeaacqWGubavaaaaaa@3338@ is a | MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFsectaaa@376E@ | × | MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFsectaaa@376E@ | diagonal matrix where M i (l, l) = 1 only when f(v) = ℓ l (v V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i ), and M i (l, l) = 0 otherwise. However, this approach considers only the presence or absence of vertices (enzymes) but does not consider the structure of the graph, such that the successive enzymes or reaction steps cannot be considered when comparing metabolic networks. To capture the structure of the graph, one must also consider vertices that can be reached from a vertex by a subsequent traverse.

In the exponential graph-kernel method, the similarity between two graphs Γ i and Γ j is defined as

k ( Γ i , Γ j ) = L i e β H i L i T , L j e β H j L j T , ( 4 ) e β H = n = 0 ( β H ) n n ! = I + β H + β 2 2 ! H 2 + , ( 5 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeGacea2jea=muaabaqadmaaaeaacqWGRbWAcqGGOaakcqqHtoWrdaWgaaWcbaGaemyAaKgabeaakiabcYcaSiabfo5ahnaaBaaaleaacqWGQbGAaeqaaOGaeiykaKcabaGaeyypa0dabaGaeyykJeUaemitaW0aaSbaaSqaaiabdMgaPbqabaGccqWGLbqzdaahaaWcbeqaaGGaciab=j7aIjabdIeainaaBaaameaacqWGPbqAaeqaaaaakiabdYeamnaaDaaaleaacqWGPbqAaeaacqWGubavaaGccqGGSaalcqWGmbatdaWgaaWcbaGaemOAaOgabeaakiabdwgaLnaaCaaaleqabaGae8NSdiMaemisaG0aaSbaaWqaaiabdQgaQbqabaaaaOGaemitaW0aa0baaSqaaiabdQgaQbqaaiabdsfaubaakiabgQYiXlabcYcaSiaaxMaacaWLjaWaaeWaaeaacqaI0aanaiaawIcacaGLPaaaaeGabea6ciaaxMaacqWGLbqzdaahaaWcbeqaaiab=j7aIjabdIeaibaaaOqaaiabg2da9aqacmqajJFavJpa5J=aaabCaeaadaWcaaqaaiabcIcaOiab=j7aIjabdIeaijabcMcaPmaaCaaaleqabaGaemOBa4gaaaGcbaGaemOBa4MaeiyiaecaaaWcbaGaemOBa4Maeyypa0JaeGimaadabaGaeyOhIukaniabggHiLdaakeaaaeaacqGH9aqpaeaacqWGjbqscqGHRaWkcqWFYoGycqWGibascqGHRaWkdaWcaaqaaiab=j7aInaaCaaaleqabaGaeGOmaidaaaGcbaGaeGOmaiJaeiyiaecaaiabdIeainaaCaaaleqabaGaeGOmaidaaOGaey4kaSIaeS47IWKaeiilaWIaaCzcaiaaxMaadaqadaqaceaaooVaeGynaudacaGLOaGaayzkaaaaaaaa@8D87@

where β (≥ 0) is a real-valued parameter and its value is chosen by performing many tries. When β = 0, it recovers the simple common vertex-counting measure since exp(0H) = I, the | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ | × | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ | identity matrix. Each element Hn (a, b) of the matrix Hn in Equation (5) represents the number of walks of length n (admitting cycles) from v a to v b , and allows the representation of the global structure of a graph.

Substituting Equation (5) into Equation (4), we can decompose the kernel function k i , Γ j ) into two meaningful parts, k i , Γ j ) = k1 i , Γ j ) + k2 i , Γ j ), where

k 1 = n = 0 β n + β n n ! n ! L i H i n L i T , L j H j n L j T ( 6 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGRbWAdaWgaaWcbaGaeGymaedabeaakiabg2da9maaqahabaWaaSaaaeaacqaHYoGydaahaaWcbeqaaiabd6gaUbaakiabgUcaRiabek7aInaaCaaaleqabaGaemOBa4gaaaGcbaGaemOBa4MaeiyiaeIaemOBa4MaeiyiaecaaaWcbaGaemOBa4Maeyypa0JaeGimaadabaGaeyOhIukaniabggHiLdGccqGHPms4cqWGmbatdaWgaaWcbaGaemyAaKgabeaakiabdIeainaaDaaaleaacqWGPbqAaeaacqWGUbGBaaGccqWGmbatdaqhaaWcbaGaemyAaKgabaGaemivaqfaaOGaeiilaWIaemitaW0aaSbaaSqaaiabdQgaQbqabaGccqWGibasdaqhaaWcbaGaemOAaOgabaGaemOBa4gaaOGaemitaW0aa0baaSqaaiabdQgaQbqaaiabdsfaubaakiabgQYiXlaaxMaacaWLjaWaaeWaaeaacqaI2aGnaiaawIcacaGLPaaaaaa@6093@
k 2 = n = m = 0 , n m β n β m n ! m ! L i H i n L i T , L j H j m L j T . ( 7 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGRbWAdaWgaaWcbaGaeGOmaidabeaakiabg2da9maaqahabaWaaSaaaeaaiiGacqWFYoGydaahaaWcbeqaaiabd6gaUbaakiab=j7aInaaCaaaleqabaGaemyBa0gaaaGcbaGaemOBa4MaeiyiaeIaemyBa0MaeiyiaecaaaWcbaGaemOBa4Maeyypa0JaemyBa0Maeyypa0JaeGimaaJaeiilaWIaemOBa4MaeyiyIKRaemyBa0gabaGaeyOhIukaniabggHiLdGccqGHPms4cqWGmbatdaWgaaWcbaGaemyAaKgabeaakiabdIeainaaDaaaleaacqWGPbqAaeaacqWGUbGBaaGccqWGmbatdaqhaaWcbaGaemyAaKgabaGaemivaqfaaOGaeiilaWIaemitaW0aaSbaaSqaaiabdQgaQbqabaGccqWGibasdaqhaaWcbaGaemOAaOgabaGaemyBa0gaaOGaemitaW0aa0baaSqaaiabdQgaQbqaaiabdsfaubaakiabgQYiXlabc6caUiaaxMaacaWLjaWaaeWaaeaacqaI3aWnaiaawIcacaGLPaaaaaa@686D@

The kernel function k1 contributes by considering walks of the same length in both graphs, and k2 can take into account the insertion or deletion of vertices in the graph [39]. As the number of movements in a graph increases, the significance of walks of length n decreases by β n n ! MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcaaqaaGGaciab=j7aInaaCaaaleqabaGaemOBa4gaaaGcbaGaemOBa4Maeiyiaecaaaaa@322F@ . Eventually, the exponential matrix eβH can be interpreted as the product of a continuous process H, from which the identity matrix expands gradually to the matrix of the global structure of Γ [40].

The exponential graph kernel requires the exponentiation of square matrices H s. This can be performed by matrix diagonalization, with time complexity of about O(| V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i |3) for H i thus Γ i . [39]. The time complexity of the element-wise product of two matrices in k i , Γ j ) is O(max (| V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i |2, | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ j |2)). With N graphs, finally, the total time complexity for constructing the kernel matrix K = {k ij } (1 ≤ i, jN) is O(NV3 + N2V2) where V = max i | V MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBamrtHrhAL1wy0L2yHvtyaeHbnfgDOvwBHrxAJfwnaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaWaaeGaeaaakeaaimaacqWFveVvaaa@384B@ i |.

From the kernel k i , Γ j ), the dissimilarity metric is defined in the standard manner, that is,

d ( Γ i , Γ j ) = k ( Γ i , Γ i ) + k ( Γ j , Γ j ) 2 k ( Γ i , Γ j ) . ( 8 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGKbazcqGGOaakcqqHtoWrdaWgaaWcbaGaemyAaKgabeaakiabcYcaSiabfo5ahnaaBaaaleaacqWGQbGAaeqaaOGaeiykaKIaeyypa0ZaaOaaaeaacqWGRbWAcqGGOaakcqqHtoWrdaWgaaWcbaGaemyAaKgabeaakiabcYcaSiabfo5ahnaaBaaaleaacqWGPbqAaeqaaOGaeiykaKIaey4kaSIaem4AaSMaeiikaGIaeu4KdC0aaSbaaSqaaiabdQgaQbqabaGccqGGSaalcqqHtoWrdaWgaaWcbaGaemOAaOgabeaakiabcMcaPiabgkHiTiabikdaYiabdUgaRjabcIcaOiabfo5ahnaaBaaaleaacqWGPbqAaeqaaOGaeiilaWIaeu4KdC0aaSbaaSqaaiabdQgaQbqabaGccqGGPaqkaSqabaGccqGGUaGlcaWLjaGaaCzcamaabmaabaGaeGioaGdacaGLOaGaayzkaaaaaa@5CCD@

If we use the normalized kernel,

k n o r m ( Γ i , Γ j ) = k ( Γ i , Γ j ) k ( Γ i , Γ i ) k ( Γ j , Γ j ) , ( 9 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGRbWAdaWgaaWcbaGaemOBa4Maem4Ba8MaemOCaiNaemyBa0gabeaakiabcIcaOiabfo5ahnaaBaaaleaacqWGPbqAaeqaaOGaeiilaWIaeu4KdC0aaSbaaSqaaiabdQgaQbqabaGccqGGPaqkcqGH9aqpdaWcaaqaaiabdUgaRjabcIcaOiabfo5ahnaaBaaaleaacqWGPbqAaeqaaOGaeiilaWIaeu4KdC0aaSbaaSqaaiabdQgaQbqabaGccqGGPaqkaeaadaGcaaqaaiabdUgaRjabcIcaOiabfo5ahnaaBaaaleaacqWGPbqAaeqaaOGaeiilaWIaeu4KdC0aaSbaaSqaaiabdMgaPbqabaGccqGGPaqkcqWGRbWAcqGGOaakcqqHtoWrdaWgaaWcbaGaemOAaOgabeaakiabcYcaSiabfo5ahnaaBaaaleaacqWGQbGAaeqaaOGaeiykaKcaleqaaaaakiabcYcaSiaaxMaacaWLjaWaaeWaaeaacqaI5aqoaiaawIcacaGLPaaaaaa@5FFA@

then the distance metric is simplified as

d ( Γ i , Γ j ) = 2 2 k n o r m ( Γ i , Γ j ) . ( 10 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGKbazcqGGOaakcqqHtoWrdaWgaaWcbaGaemyAaKgabeaakiabcYcaSiabfo5ahnaaBaaaleaacqWGQbGAaeqaaOGaeiykaKIaeyypa0ZaaOaaaeaacqaIYaGmcqGHsislcqaIYaGmcqWGRbWAdaWgaaWcbaGaemOBa4Maem4Ba8MaemOCaiNaemyBa0gabeaakiabcIcaOiabfo5ahnaaBaaaleaacqWGPbqAaeqaaOGaeiilaWIaeu4KdC0aaSbaaSqaaiabdQgaQbqabaGccqGGPaqkaSqabaGccqGGUaGlcaWLjaGaaCzcamaabmaabaGaeGymaeJaeGimaadacaGLOaGaayzkaaaaaa@4FC5@

To summarize, metabolic networks constructed from reference pathways of N organisms were first converted to labeled undirected graphs. Each graph Γ i (1 ≤ iN) was then represented by two matrices: the vertex-label matrix L i and the adjacency matrix H i . Using these two matrices, we can take into account only the local structure (the direct connectivities between enzymes in pathways) of networks. To compare networks in terms of their global structure, we adopted a kernel-based method, which we named the exponential graph kernel. Finally, the distance matrix acquired from the kernel function was fed into a hierarchical clustering algorithm to construct the phylogenetic trees.

Constructing phylogenetic trees

The distance between two organisms was calculated by comparing their metabolic networks using the measures mentioned earlier. To construct a phylogenetic tree, we used an unweighted pair-group method with arithmetic mean (UPGMA) [41, 42], a hierarchical agglomerative clustering algorithm. Given N organisms, the algorithm starts by initializing N clusters, each of which contains exactly one distinct organism, and proceeds by iteratively merging the two nearest clusters until only one cluster (called the root of the tree) remains. The dendrogram derived from UPGMA is a binary tree, which we consider may represent a binary phylogenetic tree.


  1. Whiting MF, Carpenter JC, Wheeler QD, Wheeler WC: The Strepsiptera problem: phylogeny of the holometabolous insect orders inferred from 18S and 28S ribosomal DNA sequences and morphology. Syst Biol 1997, 46: 1–68.

    CAS  PubMed  Google Scholar 

  2. Delsuc F, Brinkmann H, Philippe H: Phylogenomics and the reconstruction of the tree of life. Nature Rev Genet 2005, 6: 361–375. 10.1038/nrg1603

    Article  CAS  PubMed  Google Scholar 

  3. Fitz-Gibbon ST, House CH: Whole genome-based phylogenetic analysis of free-living microorganisms. Nucleic Acids Res 1999, 27: 4218–4222. 10.1093/nar/27.21.4218

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  4. Lin J, Gerstein M: Whole-genome trees based on the occurrence of folds and orthologs: Implications for comparing genomes on different levels. Genome Res 2000, 10: 808–818. 10.1101/gr.10.6.808

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  5. Otu HH, Sayood K: A new sequence distance measure for phylogenetic tree construction. Bioinformatics 2003, 19: 2122–2130. 10.1093/bioinformatics/btg295

    Article  CAS  PubMed  Google Scholar 

  6. Forst CV, Schulten K: Evolution of metabolisms: A new method for the comparison of metabolic pathways using genomics information. J Comp Biol 1999, 6: 343–360. 10.1089/106652799318319

    Article  CAS  Google Scholar 

  7. Forst CV, Schulten K: Phylgenetic analysis of metabolic pathways. J Mol Evol 2001, 52: 471–489.

    Article  CAS  PubMed  Google Scholar 

  8. Schuster DandekarTT, Snel B, Huynen M, Bork P: Pathway alignment: application to the comparative analysis of glycolytic enzymes. Biochem J 1999, 343: 115–124. 10.1042/0264-6021:3430115

    Article  PubMed Central  PubMed  Google Scholar 

  9. Moret BME, Wang LS, Warnow T, Wyman SK: New approaches for reconstructing phylogenies from gene order data. Bioinformatics 2001, 17: S165-S173.

    Article  PubMed  Google Scholar 

  10. Liao L, Kim S, Tomb JF: Genome comparisons based on profiles of metabolic pathways. Proceedings of the Sixth International Conference on Knowledge-based Intelligent Information & Engineering Systems 2002, 469–476.

    Google Scholar 

  11. Heymans M, Singh AK: Deriving phylogenetic trees from the similarity analysis of metabolic pathways. Bioinformatics 2003, 19: i138-i146. 10.1093/bioinformatics/btg1018

    Article  PubMed  Google Scholar 

  12. Wolf YI, Rogozin IB, Grishin NV, Tatusov RL, Koonin EV: Genome trees constructed using five different approaches suggest new major bacterial clades. BMC Evol Biol 2001, 1: 8. 10.1186/1471-2148-1-8

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  13. Korbel JO, Snel B, Huynen MA, Bork P: SHOT: a web server for the construction of genome phylogenies. Trends Genet 2002, 18: 158–162. 10.1016/S0168-9525(01)02597-5

    Article  CAS  PubMed  Google Scholar 

  14. Tekaia F, Lazcano A, Dujon B: The genomic tree as revealed from whole proteome comparison. Genome Res 1999, 9: 550–557.

    PubMed Central  CAS  PubMed  Google Scholar 

  15. Grishin NV, Wolf YI, Koonin EV: From complete genomes to measures of substitution rate variability within and between proteins. Genome Res 2000, 10: 991–1000. 10.1101/gr.10.7.991

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  16. Henz SR, Huson DH, Auch AF, Nieselt-Struwe K, Schuster SC: Whole-genome prokaryotic phylogeny. Bioinformatics 2005, 21: 2329–2335. 10.1093/bioinformatics/bth324

    Article  CAS  PubMed  Google Scholar 

  17. Qi J, Wang B, Hao BI: Whole proteome prokaryote phylogeny without sequence alignment: a K-string composition approach. J Mol Evol 2004, 58: 1–11. 10.1007/s00239-003-2493-7

    Article  CAS  PubMed  Google Scholar 

  18. Daubin V, Gouy M, Perriere G: A phylogenomic approach to bacterial phylogeny: evidence of a core of genes sharing a common history. Genome Res 2002, 12: 1080–1090. 10.1101/gr.187002

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  19. Rokas A, Williams BL, King L, Carroll SB: Genome-scale approaches to resolving incongruence in molecular phylogenies. Nature 2003, 425: 798–804. 10.1038/nature02053

    Article  CAS  PubMed  Google Scholar 

  20. Woese CR, Kandler O, L WM: Towards a natural system of organisms: Proposal for the domains Archaea, Bacteria, and Eucarya. Proc Natl Acad Sci USA 1990, 87: 4576–4579. 10.1073/pnas.87.12.4576

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  21. Doolittle WF: Phylogenetic classification and the universal tree. Science 1999, 284: 2124–2128. 10.1126/science.284.5423.2124

    Article  CAS  PubMed  Google Scholar 

  22. Lake JA, Moore JE: Phylogenetic analysis and comparative genomics. Trends Guide to Bioinformatics 1998.

    Google Scholar 

  23. Podani J, Oltvai ZN, Jeong H, Tombor B, Barabasi AL: Comparable system-level organization of Archaea and Eukaryotes. Nat Genet 2001, 29: 54–56. 10.1038/ng708

    Article  CAS  PubMed  Google Scholar 

  24. Rivera MC, Jain R, Moore JE, Lake JA: Genomic evidence for two functionally distinct gene classes. Proc Natl Acad Sci USA 1998, 95: 6239–6244. 10.1073/pnas.95.11.6239

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  25. Canback B, Andersson SGE, Kurland CG: The global phylogeny of glycolytic enzymes. Proc Natl Acad Sci USA 2002, 99: 6097–6102. 10.1073/pnas.082112499

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  26. Jain R, Rivera MC, Lake JA: Horizontal gene transfer among genomes: the complexity hypothesis. Proc Natl Acad Sci USA 1999, 96: 3801–3806. 10.1073/pnas.96.7.3801

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  27. Doolittle WF: Lateral genomics. Trends Cell Biol 1999, 9: M5-M8. 10.1016/S0962-8924(99)01664-5

    Article  CAS  PubMed  Google Scholar 

  28. Li M, Badger JH, Chen X, Kwong S, Kearney P, Zhang H: An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics 2001, 17: 149–154. 10.1093/bioinformatics/17.2.149

    Article  CAS  PubMed  Google Scholar 

  29. Keeling PJ, Palmer JD: Lateral transfer at the gene and subgenic levels in the evolution of eukaryotic enolase. Proc Natl Acad Sci USA 2001, 98: 10745–10750. 10.1073/pnas.191337098

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  30. Nye TMW, Lio P, Gilks WR: A novel algorithm and web-based tool for comparing two alternative phylogenetic trees. Bioinformatics 2006, 22: 117–119. 10.1093/bioinformatics/bti720

    Article  CAS  PubMed  Google Scholar 

  31. Zhang K, Wang JTL, Shasha D: On the editing distance between undirected acyclic graphs. Int J Foundations Comput Sci 1996, 7: 43–57. 10.1142/S0129054196000051

    Article  Google Scholar 

  32. Fritz B, Raczniak GA: Bacterial genomics: potential for antimicrobial drug discovery. Biodrugs 2002, 16: 331–337. 10.2165/00063030-200216050-00002

    Article  CAS  PubMed  Google Scholar 

  33. Doolittle WF, Brown JR: Tempo, mode, the progenote, and the universal root. Proc Natl Acad Sci USA 1994, 91: 6721–6728. 10.1073/pnas.91.15.6721

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  34. Doolittle WF, Logsdon JM Jr: Archaeal genomics: Do archaea have a mixed heritage? Curr Biol 1998, 8: R209-R211. 10.1016/S0960-9822(98)70127-7

    Article  CAS  PubMed  Google Scholar 

  35. Wolf YI, Rogozin IB, Grishin NV, Koonin EV: Genome trees and the tree of life. Trends Genet 2002, 18: 472–479. 10.1016/S0168-9525(02)02744-0

    Article  CAS  PubMed  Google Scholar 

  36. Tree of Life[]

  37. Ogata H, Goto SK, Fujibuchi H, Bono H, Kanehisa M: KEGG: Kyoto encyclopedia of genes and genomes. Nucleic Acids Res 1999, 27: 29–34. 10.1093/nar/27.1.29

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  38. Goto S, Okuno Y, Hattori M, Nishioka T, Kanehisa M: LIGAND: database of chemical compounds and reactions in biological pathways. Nucleic Acids Res 2002, 30: 402–404. 10.1093/nar/30.1.402

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  39. Gärtner T: Exponential and Geometric Kernels for Graphs. NIPS 2002 Workshop on Unreal Data: Principles of Modeling Nonvectorial Data 2002.

    Google Scholar 

  40. Kondor RI, Lafferty J: Diffusion kernels on graphs and other discrete input spaces. Proceedings of 19th International Conference on Machine Learning 2002, 315–322.

    Google Scholar 

  41. Jain AK, Dubes RC: Algorithms for Clustering Data. 2nd edition. address in USA: Prentice Hall; 1988.

    Google Scholar 

  42. Durbin R, Eddy SR, Krogh A, Mitchison G: Biological Sequence Analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press; 1998.

    Book  Google Scholar 

  43. Page RDM: TREEVIEW: An application to display phylogenetic trees on personal computers. CABIOS 1996, 12: 357–358.

    CAS  PubMed  Google Scholar 

  44. NCBI taxonomy[]

Download references


This research was supported by the National Research Laboratory (NRL) Program (M1041200095-04J0000-03610) of Korean Ministry of Science and Technology and the Inje University research grant.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Byoung-Tak Zhang.

Additional information

Authors' contributions

SJO proposed the idea, organized overall procedure, built the data set for computational experiments and carried out an analysis of experimental results. JGJ built the data set for computational experiments and carried out an analysis of experimental results. JHC carried out implementation of the computational method on graph kernels, computational experiments and analysis. BTZ developed the idea, provided intellectual guidance and mentorship. All authors read and approved the final manuscript.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Oh, S., Joung, JG., Chang, JH. et al. Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks. BMC Bioinformatics 7, 284 (2006).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: