首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 437 毫秒
1.
Metabolic databases contain information about thousands of small molecules and reactions, which can be represented as networks. In the context of metabolic reconstruction, pathways can be inferred by searching optimal paths in such networks. A recurrent problem is the presence of pool metabolites (e.g., water, energy carriers, and cofactors), which are connected to hundreds of reactions, thus establishing irrelevant shortcuts between nodes of the network. One solution to this problem relies on weighted networks to penalize highly connected compounds. A more refined solution takes the chemical structure of reactants into account in order to differentiate between side and main compounds of a reaction. Thanks to an intensive annotation effort at KEGG, decompositions of reactions into reactant pairs (RPAIR) categorized by their role (main, trans, cofac, ligase, and leave) are now available.The goal of this article is to evaluate the impact of RPAIR data on pathfinding in metabolic networks. To this end, we measure the impact of different parameters concerning the construction of the metabolic network: mapping of reactions and reactant pairs onto a graph, use of selected categories of reactant pairs, weighting schemes for compounds and reactions, removal of highly connected metabolites, and reaction directionality. In total, we tested 104 combinations of parameters and identified their optimal values for pathfinding on the basis of 55 reference pathways from three organisms.The best-performing metabolic network combines the biochemical knowledge encoded by KEGG RPAIR with a weighting scheme penalizing highly connected compounds. With this network, we could recover reference pathways from Escherichia coli with an average accuracy of 93% (32 pathways), from Saccharomyces cerevisiae with an average accuracy of 66% (11 pathways), and from humans with an average accuracy of 70% (12 pathways). Our pathfinding approach is available as part of the Network Analysis Tools.  相似文献   

2.
Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC)   总被引:1,自引:0,他引:1  
MOTIVATION: Pathway Hunter Tool (PHT), is a fast, robust and user-friendly tool to analyse the shortest paths in metabolic pathways. The user can perform shortest path analysis for one or more organisms or can build virtual organisms (networks) using enzymes. Using PHT, the user can also calculate the average shortest path (Jungnickel, 2002 Graphs, Network and Algorithm. Springer-Verlag, Berlin), average alternate path and the top 10 hubs in the metabolic network. The comparative study of metabolic connectivity and observing the cross talk between metabolic pathways among various sequenced genomes is possible. RESULTS: A new algorithm for finding the biochemically valid connectivity between metabolites in a metabolic network was developed and implemented. A predefined manual assignment of side metabolites (like ATP, ADP, water, CO(2) etc.) and main metabolites is not necessary as the new concept uses chemical structure information (global and local similarity) between metabolites for identification of the shortest path.  相似文献   

3.
Putative gene predictions of the Gram positive actinobacteria Micrococcus luteus (NCTC 2665, "Fleming strain") was used to construct a genome scale reconstruction of the metabolic network for this organism. The metabolic network comprises 586 reactions and 551 metabolites, and accounts for 21% of the genes in the genome. The reconstruction was based on the annotated genome and available biochemical information. M. luteus has one of the smallest genomes of actinobacteria with a circular chromosome of 2,501,097 base pairs and a GC content of 73%. The metabolic pathways required for biomass production in silico were determined based on earlier models of actinobacteria. The in silico network is used for metabolic comparison of M. luteus with other actinomycetes, and hence provides useful information for possible future biotechnological exploitation of this organism, e.g., for production of biofuels.  相似文献   

4.
MOTIVATION: Pathway knowledge in public databases enables us to examine how individual metabolites are connected via chemical reactions and what genes are implicated in those processes. For two given (sets of) compounds, the number of possible paths between them in a metabolic network can be intractably large. It would be informative to rank these paths in order to differentiate between them. RESULTS: Focusing on adjacent pairwise coexpression, we developed an algorithm which, for a specified k, efficiently outputs the top k paths based on a probabilistic scoring mechanism, using a given metabolic network and microarray datasets. Our idea of using adjacent pairwise coexpression is supported by recent studies that local coregulation is predominant in metabolism. We first evaluated this idea by examining to what extent highly correlated gene pairs are adjacent and how often they are consecutive in a metabolic network. We then applied our algorithm to two examples of path ranking: the paths from glucose to pyruvate in the entire metabolic network of yeast and the paths from phenylalanine to sinapyl alcohol in monolignols pathways of arabidopsis under several different microarray conditions, to confirm and discuss the performance analysis of our method.  相似文献   

5.
6.
MOTIVATION: Metabolic networks are organized in a modular, hierarchical manner. Methods for a rational decomposition of the metabolic network into relatively independent functional subsets are essential to better understand the modularity and organization principle of a large-scale, genome-wide network. Network decomposition is also necessary for functional analysis of metabolism by pathway analysis methods that are often hampered by the problem of combinatorial explosion due to the complexity of metabolic network. Decomposition methods proposed in literature are mainly based on the connection degree of metabolites. To obtain a more reasonable decomposition, the global connectivity structure of metabolic networks should be taken into account. RESULTS: In this work, we use a reaction graph representation of a metabolic network for the identification of its global connectivity structure and for decomposition. A bow-tie connectivity structure similar to that previously discovered for metabolite graph is found also to exist in the reaction graph. Based on this bow-tie structure, a new decomposition method is proposed, which uses a distance definition derived from the path length between two reactions. An hierarchical classification tree is first constructed from the distance matrix among the reactions in the giant strong component of the bow-tie structure. These reactions are then grouped into different subsets based on the hierarchical tree. Reactions in the IN and OUT subsets of the bow-tie structure are subsequently placed in the corresponding subsets according to a 'majority rule'. Compared with the decomposition methods proposed in literature, ours is based on combined properties of the global network structure and local reaction connectivity rather than, primarily, on the connection degree of metabolites. The method is applied to decompose the metabolic network of Escherichia coli. Eleven subsets are obtained. More detailed investigations of the subsets show that reactions in the same subset are really functionally related. The rational decomposition of metabolic networks, and subsequent studies of the subsets, make it more amenable to understand the inherent organization and functionality of metabolic networks at the modular level. SUPPLEMENTARY INFORMATION: http://genome.gbf.de/bioinformatics/  相似文献   

7.
Elementary modes (EMs) are steady-state metabolic flux vectors with minimal set of active reactions. Each EM corresponds to a metabolic pathway. Therefore, studying EMs is helpful for analyzing the production of biotechnologically important metabolites. However, memory requirements for computing EMs may hamper their applicability as, in most genome-scale metabolic models, no EM can be computed due to running out of memory. In this study, we present a method for computing randomly sampled EMs. In this approach, a network reduction algorithm is used for EM computation, which is based on flux balance-based methods. We show that this approach can be used to recover the EMs in the medium- and genome-scale metabolic network models, while the EMs are sampled in an unbiased way. The applicability of such results is shown by computing “estimated” control-effective flux values in Escherichia coli metabolic network.  相似文献   

8.
Infection caused by methicillin-resistant Staphylococcus aureus (MRSA) is an increasing societal problem. Typically, glycopeptide antibiotics are used in the treatment of these infections. The most comprehensively studied glycopeptide antibiotic biosynthetic pathway is that of balhimycin biosynthesis in Amycolatopsis balhimycina. The balhimycin yield obtained by A. balhimycina is, however, low and there is therefore a need to improve balhimycin production. In this study, we performed genome sequencing, assembly and annotation analysis of A. balhimycina and further used these annotated data to reconstruct a genome-scale metabolic model for the organism. Here we generated an almost complete A. balhimycina genome sequence comprising 10,562,587 base pairs assembled into 2,153 contigs. The high GC-genome (~ 69%) includes 8,585 open reading frames (ORFs). We used our integrative toolbox called SEQTOR for functional annotation and then integrated annotated data with biochemical and physiological information available for this organism to reconstruct a genome-scale metabolic model of A. balhimycina. The resulting metabolic model contains 583 ORFs as protein encoding genes (7% of the predicted 8,585 ORFs), 407 EC numbers, 647 metabolites and 1,363 metabolic reactions. During the analysis of the metabolic model, linear, quadratic and evolutionary programming algorithms using flux balance analysis (FBA), minimization of metabolic adjustment (MOMA), and OptGene, respectively were applied as well as phenotypic behavior and improved balhimycin production were simulated. The A. balhimycina model shows a good agreement between in silico data and experimental data and also identifies key reactions associated with increased balhimycin production. The reconstruction of the genome-scale metabolic model of A. balhimycina serves as a basis for physiological characterization. The model allows a rational design of engineering strategies for increasing balhimycin production in A. balhimycina and glycopeptide production in general.  相似文献   

9.
10.
Metabolic reactions are fundamental to living organisms, and a large number of reactions simultaneously occur at a given time in living cells transforming diverse metabolites into each other. There has been an ongoing debate on how to classify metabolites with respect to their importance for metabolic performance, usually based on the analysis of topological properties of genome scale metabolic networks. However, none of these studies have accounted quantitatively for flux in metabolic networks, thus lacking an important component of a cell’s biochemistry.We therefore analyzed a genome scale metabolic network of Escherichia coli by comparing growth under 19 different growth conditions, using flux balance analysis and weighted network centrality investigation. With this novel concept of flux centrality we generated metabolite rankings for each particular growth condition. In contrast to the results of conventional analysis of genome scale metabolic networks, different metabolites were top-ranking dependent on the growth condition. At the same time, several metabolites were consistently among the high ranking ones. Those are associated with pathways that have been described by biochemists as the most central part of metabolism, such as glycolysis, tricarboxylic acid cycle and pentose phosphate pathway. The values for the average path length of the analyzed metabolite networks were between 10.5 and 12.6, supporting recent findings that the metabolic network of E. coli is not a small-world network.  相似文献   

11.
Path matching and graph matching in biological networks.   总被引:2,自引:0,他引:2  
We develop algorithms for the following path matching and graph matching problems: (i) given a query path p and a graph G, find a path p' that is most similar to p in G; (ii) given a query graph G (0) and a graph G, find a graph G (0)' that is most similar to G (0) in G. In these problems, p and G (0) represent a given substructure of interest to a biologist, and G represents a large network in which the biologist desires to find a related substructure. These algorithms allow the study of common substructures in biological networks in order to understand how these networks evolve both within and between organisms. We reduce the path matching problem to finding a longest weighted path in a directed acyclic graph and show that the problem of finding top k suboptimal paths can be solved in polynomial time. This is in contrast with most previous approaches that used exponential time algorithms to find simple paths which are practical only when the paths are short. We reduce the graph matching problem to finding highest scoring subgraphs in a graph and give an exact algorithm to solve the problem when the query graph G (0) is of moderate size. This eliminates the need for less accurate heuristic or randomized algorithms.We show that our algorithms are able to extract biologically meaningful pathways from protein interaction networks in the DIP database and metabolic networks in the KEGG database. Software programs implementing these techniques (PathMatch and GraphMatch) are available at http://faculty.cs.tamu.edu/shsze/pathmatch and http://faculty.cs.tamu.edu/shsze/graphmatch.  相似文献   

12.
Metabolic flux analysis (MFA) has so far been restricted to lumped networks lacking many important pathways, partly due to the difficulty in automatically generating isotope mapping matrices for genome-scale metabolic networks. Here we introduce a procedure that uses a compound matching algorithm based on the graph theoretical concept of pattern recognition along with relevant reaction information to automatically generate genome-scale atom mappings which trace the path of atoms from reactants to products for every reaction. The procedure is applied to the iAF1260 metabolic reconstruction of Escherichia coli yielding the genome-scale isotope mapping model imPR90068. This model maps 90,068 non-hydrogen atoms that span all 2,077 reactions present in iAF1260 (previous largest mapping model included 238 reactions). The expanded scope of the isotope mapping model allows the complete tracking of labeled atoms through pathways such as cofactor and prosthetic group biosynthesis and histidine metabolism. An EMU representation of imPR90068 is also constructed and made available.  相似文献   

13.
The relation between the position of mutations in Saccharomyces cerevisiae metabolic network and their lethality is the subject of this work. We represent the topology of the network by a directed graph: nodes are metabolites and arcs represent the reactions; a mutation corresponds to the removal of all the arcs referring to the deleted enzyme. Using publicly available knock-out data, we show that lethality corresponds to the lack of alternative paths in the perturbed network linking the nodes affected by the enzyme deletion. Such feature is at the basis of the recently recognized importance of 'marginal' arcs of metabolic networks.  相似文献   

14.
Experimental and modeling work, described in this article, is focused on the metabolic pathway of Chinese hamster ovary (CHO) cells, which are the preferred expression system for monoclonal antibody protein production. CHO cells are one of the primary hosts for monoclonal antibodies production, which have extensive applications in multiple fields like biochemistry, biology and medicine. Here, an approach to explain cellular metabolism with in silico modeling of a microkinetic reaction network is presented and validated with unique experimental results. Experimental data of 25 different fed‐batch bioprocesses included the variation of multiple process parameters, such as pH, agitation speed, oxygen and CO2 content, and dissolved oxygen. A total of 151 metabolites were involved in our proposed metabolic network, which consisted of 132 chemical reactions that describe the reaction pathways, and include 25 reactions describing N‐glycosylation and additional reactions for the accumulation of the produced glycoforms. Additional eight reactions are considered for accumulation of the N‐glycosylation products in the extracellular environment and one reaction to correlate cell degradation. The following pathways were considered: glycolysis, pentose phosphate pathway, nucleotide synthesis, tricarboxylic acid cycle, lipid synthesis, protein synthesis, biomass production, anaplerotic reactions, and membrane transport. With the applied modeling procedure, different operational scenarios and fed‐batch techniques can be tested.  相似文献   

15.
Recent work has revealed much about chemical reactions inside hundreds of organisms as well as universal characteristics of metabolic networks, which shed light on the evolution of the networks. However, characteristics of individual metabolites have been neglected. For example, some carbohydrates have structures that are decomposed into small molecules by metabolic reactions, but coenzymes such as ATP are mostly preserved. Such differences in metabolite characteristics are important for understanding the universal characteristics of metabolic networks. To quantify the structure conservation of metabolites, we defined the "structure conservation index" (SCI) for each metabolite as the fraction of metabolite atoms restored to their original positions through metabolic reactions. As expected, coenzymes and coenzyme-like metabolites that have reaction loops in the network show a higher SCI. Using the index, we found that the sum of metabolic fluxes is negatively correlated with the structure preservation of metabolite. Also, we found that each reaction path around high SCI metabolites changes independently, while changes in reaction paths involving low SCI metabolites coincide through evolution processes. These correlations may provide a clue to universal properties of metabolic networks.  相似文献   

16.
A genome-scale metabolic network reconstruction for Clostridium acetobutylicum (ATCC 824) was carried out using a new semi-automated reverse engineering algorithm. The network consists of 422 intracellular metabolites involved in 552 reactions and includes 80 membrane transport reactions. The metabolic network illustrates the reliance of clostridia on the urea cycle, intracellular L-glutamate solute pools, and the acetylornithine transaminase for amino acid biosynthesis from the 2-oxoglutarate precursor. The semi-automated reverse engineering algorithm identified discrepancies in reaction network databases that are major obstacles for fully automated network-building algorithms. The proposed semi-automated approach allowed for the conservation of unique clostridial metabolic pathways, such as an incomplete TCA cycle. A thermodynamic analysis was used to determine the physiological conditions under which proposed pathways (e.g., reverse partial TCA cycle and reverse arginine biosynthesis pathway) are feasible. The reconstructed metabolic network was used to create a genome-scale model that correctly characterized the butyrate kinase knock-out and the asolventogenic M5 pSOL1 megaplasmid degenerate strains. Systematic gene knock-out simulations were performed to identify a set of genes encoding clostridial enzymes essential for growth in silico.  相似文献   

17.
MOTIVATION: The local and global aspects of metabolic network analyses allow us to identify enzymes or reactions that are crucial for the survival of the organism(s), therefore directing us towards the discovery of potential drug targets. RESULTS: We demonstrate a new method ('load points') to rank the enzymes/metabolites in the metabolic network and propose a model to determine and rank the biochemical lethality in metabolic networks (enzymes/metabolites) through 'choke points'. Based on an extended form of the graph theory model of metabolic networks, metabolite structural information was used to calculate the k-shortest paths between metabolites (the presence of more than one competing path between substrate and product). On the basis of these paths and connectivity information, load points were calculated and used to empirically rank the importance of metabolites/enzymes in the metabolic network. The load point analysis emphasizes the role that the biochemical structure of a metabolite, rather than its connectivity (hubs), plays in the conversion pathway. In order to identify potential drug targets (based on the biochemical lethality of metabolic networks), the concept of choke points and load points was used to find enzymes (edges) which uniquely consume or produce a particular metabolite (nodes). A non-pathogenic bacterial strain Bacillus subtilis 168 (lactic acid producing bacteria) and a related pathogenic bacterial strain Bacillus anthracis Sterne (avirulent but toxigenic strain, producing the toxin Anthrax) were selected as model organisms. The choke point strategy was implemented on the pathogen bacterial network of B.anthracis Sterne. Potential drug targets are proposed based on the analysis of the top 10 choke points in the bacterial network. A comparative study between the reported top 10 bacterial choke points and the human metabolic network was performed. Further biological inferences were made on results obtained by performing a homology search against the human genome. AVAILABILITY: The load and choke point modules are introduced in the Pathway Hunter Tool (PHT), the basic version of which is available on http://www.pht.uni-koeln.de.  相似文献   

18.
代谢工程作为通过引入外源合成途径或改造优化代谢网络,进行高附加值的天然代谢产物生物合成的技术,已经得到广泛应用。但随着目标合成产物的结构日渐复杂,构建多基因的从头合成途径造成宿主生物代谢失衡与中间产物对宿主细胞产生毒害作用等一系列问题发生的可能性也随之增加。为解决这些问题合成支架策略应运而生,合成支架将途径酶共定位以提高局部酶和代谢物的浓度,来增强代谢通量并限制中间产物与宿主细胞环境间的相互作用,成为生物催化和合成生物学研究的热点之一。尽管由核酸、蛋白质构成的合成支架策略已经应用于多种代谢物的异源合成,并取得了不同程度的成功,但合成支架的精确组装仍然是一项艰巨的任务。文中详细介绍了合成支架技术的研究现状,详细阐述了合成支架技术的原理和实例,并初步探讨了其应用前景。  相似文献   

19.
Equations were derived for the instantaneous relative sensitivities of reaction rates (controllability indices) and metabolite concentrations (response indices) to perturbations in the values of rate constants and were used to analyze the behavior of a model of in vivo glutamate metabolism in rat brain. Controllabilities of reversible reactions were found to increase as the values of the corresponding rate constants (i.e., the rate of approach to equilibrium) increased. Response indices generally declined with the metabolic distance between the metabolite and the rate constant, but they were unexpectedly high for reversible reactions with high controllabilities. The transient response of a given metabolite is most sensitive to reactions involving metabolites which are changing most rapidly relative to their respective pool sizes. Rapidly reversible reactions are most important for communication between metabolite pools.  相似文献   

20.
MOTIVATION: A metabolic graph represents the connectivity patterns of a metabolic system, and provides a powerful framework within which the organization of metabolic reactions can be analyzed and elucidated. A common practice is to prune (i.e. remove nodes and edges) the metabolic graph prior to any analysis in order to eliminate confounding signals from the representation. Currently, this pruning process is carried out in an ad hoc fashion, resulting in discrepancies and ambiguities across studies. RESULTS: We propose a biochemically informative criterion, the strength of chemical linkage (SCL), for a systematic pruning of metabolic graphs. By analyzing the metabolic graph of Escherichia coli, we show that thresholding SCL is powerful in selecting the conventional pathways' connectivity out of the raw network connectivity when the network is restricted to the reactions collected from these pathways. Further, we argue that the root of ambiguity in pruning metabolic graphs is in the continuity of the amount of chemical content that can be conserved in reaction transformation patterns. Finally, we demonstrate how biochemical pathways can be inferred efficiently if the search procedure is guided by SCL.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号