2,645 research outputs found

    Identification of metabolic pathways using pathfinding approaches: A systematic review

    Get PDF
    Metabolic pathways have become increasingly available for variousmicroorganisms. Such pathways have spurred the development of a wide array of computational tools, in particular, mathematical pathfinding approaches. This article can facilitate the understanding of computational analysis ofmetabolic pathways in genomics. Moreover, stoichiometric and pathfinding approaches inmetabolic pathway analysis are discussed. Threemajor types of studies are elaborated: stoichiometric identification models, pathway-based graph analysis and pathfinding approaches in cellular metabolism. Furthermore, evaluation of the outcomes of the pathways withmathematical benchmarkingmetrics is provided. This review would lead to better comprehension ofmetabolismbehaviors in living cells, in terms of computed pathfinding approaches. © The Author 2016

    Path finding methods accounting for stoichiometry in metabolic networks

    Get PDF
    Graph-based methods have been widely used for the analysis of biological networks. Their application to metabolic networks has been much discussed, in particular noting that an important weakness in such methods is that reaction stoichiometry is neglected. In this study, we show that reaction stoichiometry can be incorporated into path-finding approaches via mixed-integer linear programming. This major advance at the modeling level results in improved prediction of topological and functional properties in metabolic networks

    SPABBATS: A pathway-discovery method based on Boolean satisfiability that facilitates the characterization of suppressor mutants

    Get PDF
    BACKGROUND: Several computational methods exist to suggest rational genetic interventions that improve the productivity of industrial strains. Nonetheless, these methods are less effective to predict possible genetic responses of the strain after the intervention. This problem requires a better understanding of potential alternative metabolic and regulatory pathways able to counteract the targeted intervention. RESULTS: Here we present SPABBATS, an algorithm based on Boolean satisfiability (SAT) that computes alternative metabolic pathways between input and output species in a reconstructed network. The pathways can be constructed iteratively in order of increasing complexity. SPABBATS allows the accumulation of intermediates in the pathways, which permits discovering pathways missed by most traditional pathway analysis methods. In addition, we provide a proof of concept experiment for the validity of the algorithm. We deleted the genes for the glutamate dehydrogenases of the Gram-positive bacterium Bacillus subtilis and isolated suppressor mutant strains able to grow on glutamate as single carbon source. Our SAT approach proposed candidate alternative pathways which were decisive to pinpoint the exact mutation of the suppressor strain. CONCLUSIONS: SPABBATS is the first application of SAT techniques to metabolic problems. It is particularly useful for the characterization of metabolic suppressor mutants and can be used in a synthetic biology setting to design new pathways with specific input-output requirements

    Metabolic Pathway Analysis: from small to genome-scale networks

    Get PDF
    The need for mathematical modelling of biological processes has grown alongside with the achievements in the experimental field leading to the appearance and development of new fields like systems biology. Systems biology aims at generating new knowledge through modelling and integration of experimental data in order to develop a holistic understanding of organisms. In the first part of my PhD thesis, I compare two different levels of abstraction used for computing metabolic pathways, constraint-based and graph theoretical methods. I show that the current representations of metabolism as a simple graph correspond to wrong mathematical descriptions of metabolic pathways. On the other hand, the use of stoichiometric information and convex analysis as modelling framework like in elementary flux mode analysis, allows to correctly predict metabolic pathways. In the second part of the thesis, I present two of the first methods, based on elementary flux mode analysis, that can compute metabolic pathways in such large metabolic networks: the K-shortest EFMs method and the EFMEvolver method. These methods contribute to an enrichment of the mathematical tools available to model cell biology and more precisely, metabolism. The application of these new methods to biotechnological problems is also explored in this part. In the last part of my thesis, I give an overview of recent achievements in metabolic network reconstruction and constraint-based modelling as well as open issues. Moreover, I discuss possible strategies for integrating experimental data with elementary flux mode analysis. Further improvements in elementary flux mode computation on that direction are put forward

    Model-driven analysis of experimentally determined growth phenotypes for 465 yeast gene deletion mutants under 16 different conditions

    Get PDF
    An iterative approach that integrates high-throughput measurements of yeast deletion mutants and flux balance model predictions improves understanding of both experimental and computational results

    An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks

    Full text link
    Flux balance analysis has proven an effective tool for analyzing metabolic networks. In flux balance analysis, reaction rates and optimal pathways are ascertained by solving a linear program, in which the growth rate is maximized subject to mass-balance constraints. A variety of cell functions in response to environmental stimuli can be quantified using flux balance analysis by parameterizing the linear program with respect to extracellular conditions. However, for most large, genome-scale metabolic networks of practical interest, the resulting parametric problem has multiple and highly degenerate optimal solutions, which are computationally challenging to handle. An improved multi-parametric programming algorithm based on active-set methods is introduced in this paper to overcome these computational difficulties. Degeneracy and multiplicity are handled, respectively, by introducing generalized inverses and auxiliary objective functions into the formulation of the optimality conditions. These improvements are especially effective for metabolic networks because their stoichiometry matrices are generally sparse; thus, fast and efficient algorithms from sparse linear algebra can be leveraged to compute generalized inverses and null-space bases. We illustrate the application of our algorithm to flux balance analysis of metabolic networks by studying a reduced metabolic model of Corynebacterium glutamicum and a genome-scale model of Escherichia coli. We then demonstrate how the critical regions resulting from these studies can be associated with optimal metabolic modes and discuss the physical relevance of optimal pathways arising from various auxiliary objective functions. Achieving more than five-fold improvement in computational speed over existing multi-parametric programming tools, the proposed algorithm proves promising in handling genome-scale metabolic models.Comment: Accepted in J. Optim. Theory Appl. First draft was submitted on August 4th, 201
    corecore