1
|
Mathematical and Computational Modeling in Complex Biological Systems. BIOMED RESEARCH INTERNATIONAL 2017; 2017:5958321. [PMID: 28386558 PMCID: PMC5366773 DOI: 10.1155/2017/5958321] [Citation(s) in RCA: 31] [Impact Index Per Article: 4.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 10/16/2016] [Revised: 12/20/2016] [Accepted: 01/16/2017] [Indexed: 12/22/2022]
Abstract
The biological process and molecular functions involved in the cancer progression remain difficult to understand for biologists and clinical doctors. Recent developments in high-throughput technologies urge the systems biology to achieve more precise models for complex diseases. Computational and mathematical models are gradually being used to help us understand the omics data produced by high-throughput experimental techniques. The use of computational models in systems biology allows us to explore the pathogenesis of complex diseases, improve our understanding of the latent molecular mechanisms, and promote treatment strategy optimization and new drug discovery. Currently, it is urgent to bridge the gap between the developments of high-throughput technologies and systemic modeling of the biological process in cancer research. In this review, we firstly studied several typical mathematical modeling approaches of biological systems in different scales and deeply analyzed their characteristics, advantages, applications, and limitations. Next, three potential research directions in systems modeling were summarized. To conclude, this review provides an update of important solutions using computational modeling approaches in systems biology.
Collapse
|
2
|
Chaouiya C, Bérenguier D, Keating SM, Naldi A, van Iersel MP, Rodriguez N, Dräger A, Büchel F, Cokelaer T, Kowal B, Wicks B, Gonçalves E, Dorier J, Page M, Monteiro PT, von Kamp A, Xenarios I, de Jong H, Hucka M, Klamt S, Thieffry D, Le Novère N, Saez-Rodriguez J, Helikar T. SBML qualitative models: a model representation format and infrastructure to foster interactions between qualitative modelling formalisms and tools. BMC SYSTEMS BIOLOGY 2013; 7:135. [PMID: 24321545 PMCID: PMC3892043 DOI: 10.1186/1752-0509-7-135] [Citation(s) in RCA: 101] [Impact Index Per Article: 9.2] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 08/15/2013] [Accepted: 11/26/2013] [Indexed: 05/03/2023]
Abstract
BACKGROUND Qualitative frameworks, especially those based on the logical discrete formalism, are increasingly used to model regulatory and signalling networks. A major advantage of these frameworks is that they do not require precise quantitative data, and that they are well-suited for studies of large networks. While numerous groups have developed specific computational tools that provide original methods to analyse qualitative models, a standard format to exchange qualitative models has been missing. RESULTS We present the Systems Biology Markup Language (SBML) Qualitative Models Package ("qual"), an extension of the SBML Level 3 standard designed for computer representation of qualitative models of biological networks. We demonstrate the interoperability of models via SBML qual through the analysis of a specific signalling network by three independent software tools. Furthermore, the collective effort to define the SBML qual format paved the way for the development of LogicalModel, an open-source model library, which will facilitate the adoption of the format as well as the collaborative development of algorithms to analyse qualitative models. CONCLUSIONS SBML qual allows the exchange of qualitative models among a number of complementary software tools. SBML qual has the potential to promote collaborative work on the development of novel computational approaches, as well as on the specification and the analysis of comprehensive qualitative models of regulatory and signalling networks.
Collapse
Affiliation(s)
- Claudine Chaouiya
- Instituto Gulbenkian de Ciência, Rua da Quinta Grande 6, 2780-156 Oeiras, Portugal
| | - Duncan Bérenguier
- Institut de Mathématiques de Luminy, Campus de Luminy, Case 907, 13288 Marseille Cedex 9, France
| | - Sarah M Keating
- European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
| | - Aurélien Naldi
- Center for Integrative Genomics, University of Lausanne, CH-1015 Lausanne, Switzerland
| | - Martijn P van Iersel
- European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
| | - Nicolas Rodriguez
- European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
- The Babraham Institute, Babraham Research Campus, Cambridge CB22 3AT, UK
| | - Andreas Dräger
- Department of Bioengineering, University of California San Diego, La Jolla, CA 92093-0412, USA
- Center for Bioinformatics Tuebingen (ZBIT), University of Tuebingen, 72076 Tübingen, Germany
| | - Finja Büchel
- Center for Bioinformatics Tuebingen (ZBIT), University of Tuebingen, 72076 Tübingen, Germany
| | - Thomas Cokelaer
- European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
| | - Bryan Kowal
- Department of Biochemistry, University of Nebraska-Lincoln, Lincoln, NE 68588, USA
| | - Benjamin Wicks
- College of Information Science and Technology, University of Nebraska at Omaha, Omaha, NE 68182, USA
| | - Emanuel Gonçalves
- European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
| | - Julien Dorier
- Swiss-Prot & Vital-IT group, SIB- Swiss Institute of Bioinformatics, Center for Integrative Genomics, University of Lausanne, Quartier Sorge - Batiment Genopode, CH-1015 Lausanne, Switzerland
| | - Michel Page
- INRIA Grenoble – Rhône-Alpes, 655 avenue de l’Europe, Montbonnot, 38334 Saint-Ismier Cedex, France
- IAE Grenoble, Université Pierre-Mendès-France, Domaine universitaire BP 47, 38040 Grenoble Cedex 9, France
| | - Pedro T Monteiro
- Instituto Gulbenkian de Ciência, Rua da Quinta Grande 6, 2780-156 Oeiras, Portugal
- Instituto de Engenharia de Sistemas e Computadores - Investigação e Desenvolvimento (INESC-ID), Rua Alves Redol 9, 1000-029 Lisbon, Portugal
| | - Axel von Kamp
- Max Planck Institute for Dynamics of Complex Technical Systems, Sandtorstr. 1, D-39106 Magdeburg, Germany
| | - Ioannis Xenarios
- Swiss-Prot & Vital-IT group, SIB- Swiss Institute of Bioinformatics, Center for Integrative Genomics, University of Lausanne, Quartier Sorge - Batiment Genopode, CH-1015 Lausanne, Switzerland
| | - Hidde de Jong
- INRIA Grenoble – Rhône-Alpes, 655 avenue de l’Europe, Montbonnot, 38334 Saint-Ismier Cedex, France
| | - Michael Hucka
- Computing and Mathematical sciences, California Institute of Technology, Pasadena, CA 91125, USA
| | - Steffen Klamt
- Max Planck Institute for Dynamics of Complex Technical Systems, Sandtorstr. 1, D-39106 Magdeburg, Germany
| | - Denis Thieffry
- Institut de Biologie de l’Ecole Normale Supérieure (IBENS) - UMR CNRS 8197 - INSERM 1024 46 rue d’Ulm, 75230 Paris Cedex 05, France
| | - Nicolas Le Novère
- European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
- The Babraham Institute, Babraham Research Campus, Cambridge CB22 3AT, UK
| | - Julio Saez-Rodriguez
- European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI), Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
| | - Tomáš Helikar
- Department of Biochemistry, University of Nebraska-Lincoln, Lincoln, NE 68588, USA
| |
Collapse
|
3
|
Samaga R, Klamt S. Modeling approaches for qualitative and semi-quantitative analysis of cellular signaling networks. Cell Commun Signal 2013; 11:43. [PMID: 23803171 PMCID: PMC3698152 DOI: 10.1186/1478-811x-11-43] [Citation(s) in RCA: 71] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/18/2013] [Accepted: 06/20/2013] [Indexed: 12/12/2022] Open
Abstract
A central goal of systems biology is the construction of predictive models of bio-molecular networks. Cellular networks of moderate size have been modeled successfully in a quantitative way based on differential equations. However, in large-scale networks, knowledge of mechanistic details and kinetic parameters is often too limited to allow for the set-up of predictive quantitative models.Here, we review methodologies for qualitative and semi-quantitative modeling of cellular signal transduction networks. In particular, we focus on three different but related formalisms facilitating modeling of signaling processes with different levels of detail: interaction graphs, logical/Boolean networks, and logic-based ordinary differential equations (ODEs). Albeit the simplest models possible, interaction graphs allow the identification of important network properties such as signaling paths, feedback loops, or global interdependencies. Logical or Boolean models can be derived from interaction graphs by constraining the logical combination of edges. Logical models can be used to study the basic input-output behavior of the system under investigation and to analyze its qualitative dynamic properties by discrete simulations. They also provide a suitable framework to identify proper intervention strategies enforcing or repressing certain behaviors. Finally, as a third formalism, Boolean networks can be transformed into logic-based ODEs enabling studies on essential quantitative and dynamic features of a signaling network, where time and states are continuous.We describe and illustrate key methods and applications of the different modeling formalisms and discuss their relationships. In particular, as one important aspect for model reuse, we will show how these three modeling approaches can be combined to a modeling pipeline (or model hierarchy) allowing one to start with the simplest representation of a signaling network (interaction graph), which can later be refined to logical and eventually to logic-based ODE models. Importantly, systems and network properties determined in the rougher representation are conserved during these transformations.
Collapse
Affiliation(s)
- Regina Samaga
- Max Planck Institute for Dynamics of Complex Technical Systems, Sandtorstr. 1, D-39106, Magdeburg, Germany
| | - Steffen Klamt
- Max Planck Institute for Dynamics of Complex Technical Systems, Sandtorstr. 1, D-39106, Magdeburg, Germany
| |
Collapse
|
4
|
Modeling innate immune response to early Mycobacterium infection. COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE 2012; 2012:790482. [PMID: 23365620 PMCID: PMC3529460 DOI: 10.1155/2012/790482] [Citation(s) in RCA: 12] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 06/15/2012] [Revised: 09/24/2012] [Accepted: 10/08/2012] [Indexed: 02/01/2023]
Abstract
In the study of complex patterns in biology, mathematical and computational models are emerging as important tools. In addition to experimental approaches, these modeling tools have recently been applied to address open questions regarding host-pathogen interaction dynamics, including the immune response to mycobacterial infection and tuberculous granuloma formation. We present an approach in which a computational model represents the interaction of the Mycobacterium infection with the innate immune system in zebrafish at a high level of abstraction. We use the Petri Net formalism to model the interaction between the key host elements involved in granuloma formation and infection dissemination. We define a qualitative model for the understanding and description of causal relations in this dynamic process. Complex processes involving cell-cell or cell-bacteria communication can be modeled at smaller scales and incorporated hierarchically into this main model; these are to be included in later elaborations. With the infection mechanism being defined on a higher level, lower-level processes influencing the host-pathogen interaction can be identified, modeled, and tested both quantitatively and qualitatively. This systems biology framework incorporates modeling to generate and test hypotheses, to perform virtual experiments, and to make experimentally verifiable predictions. Thereby it supports the unraveling of the mechanisms of tuberculosis infection.
Collapse
|
5
|
Toni T, Jovanovic G, Huvet M, Buck M, Stumpf MPH. From qualitative data to quantitative models: analysis of the phage shock protein stress response in Escherichia coli. BMC SYSTEMS BIOLOGY 2011; 5:69. [PMID: 21569396 PMCID: PMC3127791 DOI: 10.1186/1752-0509-5-69] [Citation(s) in RCA: 15] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/19/2010] [Accepted: 05/12/2011] [Indexed: 01/05/2023]
Abstract
Background Bacteria have evolved a rich set of mechanisms for sensing and adapting to adverse conditions in their environment. These are crucial for their survival, which requires them to react to extracellular stresses such as heat shock, ethanol treatment or phage infection. Here we focus on studying the phage shock protein (Psp) stress response in Escherichia coli induced by a phage infection or other damage to the bacterial membrane. This system has not yet been theoretically modelled or analysed in silico. Results We develop a model of the Psp response system, and illustrate how such models can be constructed and analyzed in light of available sparse and qualitative information in order to generate novel biological hypotheses about their dynamical behaviour. We analyze this model using tools from Petri-net theory and study its dynamical range that is consistent with currently available knowledge by conditioning model parameters on the available data in an approximate Bayesian computation (ABC) framework. Within this ABC approach we analyze stochastic and deterministic dynamics. This analysis allows us to identify different types of behaviour and these mechanistic insights can in turn be used to design new, more detailed and time-resolved experiments. Conclusions We have developed the first mechanistic model of the Psp response in E. coli. This model allows us to predict the possible qualitative stochastic and deterministic dynamic behaviours of key molecular players in the stress response. Our inferential approach can be applied to stress response and signalling systems more generally: in the ABC framework we can condition mathematical models on qualitative data in order to delimit e.g. parameter ranges or the qualitative system dynamics in light of available end-point or qualitative information.
Collapse
Affiliation(s)
- Tina Toni
- Division of Molecular Biosciences, Imperial College London, South Kensington, London SW7 2AZ, UK.
| | | | | | | | | |
Collapse
|
6
|
Formanowicz D, Sackmann A, Kozak A, Błażewicz J, Formanowicz P. Some aspects of the anemia of chronic disorders modeled and analyzed by petri net based approach. Bioprocess Biosyst Eng 2011; 34:581-95. [PMID: 21221653 PMCID: PMC3092940 DOI: 10.1007/s00449-010-0507-6] [Citation(s) in RCA: 12] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/17/2010] [Accepted: 12/20/2010] [Indexed: 11/19/2022]
Abstract
Anemia of chronic disorders is a very important phenomenon and iron is a crucial factor of this complex process. To better understand this process and its influence on some other factors we have built a mathematical model of the human body iron homeostasis, which possibly most exactly would reflect the metabolism of iron in the case of anemia and inflammation. The model has been formulated in the language of Petri net theory, which allows for its simulation and precise analysis. The obtained results of the analysis of the model’s behavior, concerning the influence of anemia and inflammation on the transferrin receptors, and hepcidin concentration changes are the valuable complements to the knowledge following from clinical research. This analysis is one of the first attempts to investigate properties and behavior of a not fully understood biological system on a basis of its Petri net based model.
Collapse
Affiliation(s)
- Dorota Formanowicz
- Department of Clinical Biochemistry, Poznań University of Medical Sciences, Grunwaldzka 6, 60-780, Poznań, Poland.
| | | | | | | | | |
Collapse
|
7
|
A mathematical framework for agent based models of complex biological networks. Bull Math Biol 2010; 73:1583-602. [PMID: 20878493 DOI: 10.1007/s11538-010-9582-8] [Citation(s) in RCA: 29] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/08/2010] [Accepted: 09/06/2010] [Indexed: 10/19/2022]
Abstract
Agent-based modeling and simulation is a useful method to study biological phenomena in a wide range of fields, from molecular biology to ecology. Since there is currently no agreed-upon standard way to specify such models, it is not always easy to use published models. Also, since model descriptions are not usually given in mathematical terms, it is difficult to bring mathematical analysis tools to bear, so that models are typically studied through simulation. In order to address this issue, Grimm et al. proposed a protocol for model specification, the so-called ODD protocol, which provides a standard way to describe models. This paper proposes an addition to the ODD protocol which allows the description of an agent-based model as a dynamical system, which provides access to computational and theoretical tools for its analysis. The mathematical framework is that of algebraic models, that is, time-discrete dynamical systems with algebraic structure. It is shown by way of several examples how this mathematical specification can help with model analysis. This mathematical framework can also accommodate other model types such as Boolean networks and the more general logical models, as well as Petri nets.
Collapse
|
8
|
McMillan LEM, Martin ACR. Automatically extracting functionally equivalent proteins from SwissProt. BMC Bioinformatics 2008; 9:418. [PMID: 18838004 PMCID: PMC2576269 DOI: 10.1186/1471-2105-9-418] [Citation(s) in RCA: 10] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/03/2008] [Accepted: 10/06/2008] [Indexed: 11/10/2022] Open
Abstract
Background There is a frequent need to obtain sets of functionally equivalent homologous proteins (FEPs) from different species. While it is usually the case that orthology implies functional equivalence, this is not always true; therefore datasets of orthologous proteins are not appropriate. The information relevant to extracting FEPs is contained in databanks such as UniProtKB/Swiss-Prot and a manual analysis of these data allow FEPs to be extracted on a one-off basis. However there has been no resource allowing the easy, automatic extraction of groups of FEPs – for example, all instances of protein C. We have developed FOSTA, an automatically generated database of FEPs annotated as having the same function in UniProtKB/Swiss-Prot which can be used for large-scale analysis. The method builds a candidate list of homologues and filters out functionally diverged proteins on the basis of functional annotations using a simple text mining approach. Results Large scale evaluation of our FEP extraction method is difficult as there is no gold-standard dataset against which the method can be benchmarked. However, a manual analysis of five protein families confirmed a high level of performance. A more extensive comparison with two manually verified functional equivalence datasets also demonstrated very good performance. Conclusion In summary, FOSTA provides an automated analysis of annotations in UniProtKB/Swiss-Prot to enable groups of proteins already annotated as functionally equivalent, to be extracted. Our results demonstrate that the vast majority of UniProtKB/Swiss-Prot functional annotations are of high quality, and that FOSTA can interpret annotations successfully. Where FOSTA is not successful, we are able to highlight inconsistencies in UniProtKB/Swiss-Prot annotation. Most of these would have presented equal difficulties for manual interpretation of annotations. We discuss limitations and possible future extensions to FOSTA, and recommend changes to the UniProtKB/Swiss-Prot format, which would facilitate text-mining of UniProtKB/Swiss-Prot.
Collapse
Affiliation(s)
- Lisa E M McMillan
- Research Department of Structural & Molecular Biology, University College London, Gower Street, London WC1E 6BT, UK.
| | | |
Collapse
|
9
|
Toward the automated generation of genome-scale metabolic networks in the SEED. BMC Bioinformatics 2007; 8:139. [PMID: 17462086 PMCID: PMC1868769 DOI: 10.1186/1471-2105-8-139] [Citation(s) in RCA: 94] [Impact Index Per Article: 5.5] [Reference Citation Analysis] [Abstract] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/22/2006] [Accepted: 04/26/2007] [Indexed: 12/13/2022] Open
Abstract
Background Current methods for the automated generation of genome-scale metabolic networks focus on genome annotation and preliminary biochemical reaction network assembly, but do not adequately address the process of identifying and filling gaps in the reaction network, and verifying that the network is suitable for systems level analysis. Thus, current methods are only sufficient for generating draft-quality networks, and refinement of the reaction network is still largely a manual, labor-intensive process. Results We have developed a method for generating genome-scale metabolic networks that produces substantially complete reaction networks, suitable for systems level analysis. Our method partitions the reaction space of central and intermediary metabolism into discrete, interconnected components that can be assembled and verified in isolation from each other, and then integrated and verified at the level of their interconnectivity. We have developed a database of components that are common across organisms, and have created tools for automatically assembling appropriate components for a particular organism based on the metabolic pathways encoded in the organism's genome. This focuses manual efforts on that portion of an organism's metabolism that is not yet represented in the database. We have demonstrated the efficacy of our method by reverse-engineering and automatically regenerating the reaction network from a published genome-scale metabolic model for Staphylococcus aureus. Additionally, we have verified that our method capitalizes on the database of common reaction network components created for S. aureus, by using these components to generate substantially complete reconstructions of the reaction networks from three other published metabolic models (Escherichia coli, Helicobacter pylori, and Lactococcus lactis). We have implemented our tools and database within the SEED, an open-source software environment for comparative genome annotation and analysis. Conclusion Our method sets the stage for the automated generation of substantially complete metabolic networks for over 400 complete genome sequences currently in the SEED. With each genome that is processed using our tools, the database of common components grows to cover more of the diversity of metabolic pathways. This increases the likelihood that components of reaction networks for subsequently processed genomes can be retrieved from the database, rather than assembled and verified manually.
Collapse
|
10
|
Application of Petri net based analysis techniques to signal transduction pathways. BMC Bioinformatics 2006; 7:482. [PMID: 17081284 PMCID: PMC1686943 DOI: 10.1186/1471-2105-7-482] [Citation(s) in RCA: 96] [Impact Index Per Article: 5.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/05/2006] [Accepted: 11/02/2006] [Indexed: 11/10/2022] Open
Abstract
BACKGROUND Signal transduction pathways are usually modelled using classical quantitative methods, which are based on ordinary differential equations (ODEs). However, some difficulties are inherent in this approach. On the one hand, the kinetic parameters involved are often unknown and have to be estimated. With increasing size and complexity of signal transduction pathways, the estimation of missing kinetic data is not possible. On the other hand, ODEs based models do not support any explicit insights into possible (signal-) flows within the network. Moreover, a huge amount of qualitative data is available due to high-throughput techniques. In order to get information on the systems behaviour, qualitative analysis techniques have been developed. Applications of the known qualitative analysis methods concern mainly metabolic networks. Petri net theory provides a variety of established analysis techniques, which are also applicable to signal transduction models. In this context special properties have to be considered and new dedicated techniques have to be designed. METHODS We apply Petri net theory to model and analyse signal transduction pathways first qualitatively before continuing with quantitative analyses. This paper demonstrates how to build systematically a discrete model, which reflects provably the qualitative biological behaviour without any knowledge of kinetic parameters. The mating pheromone response pathway in Saccharomyces cerevisiae serves as case study. RESULTS We propose an approach for model validation of signal transduction pathways based on the network structure only. For this purpose, we introduce the new notion of feasible t-invariants, which represent minimal self-contained subnets being active under a given input situation. Each of these subnets stands for a signal flow in the system. We define maximal common transition sets (MCT-sets), which can be used for t-invariant examination and net decomposition into smallest biologically meaningful functional units. CONCLUSION The paper demonstrates how Petri net analysis techniques can promote a deeper understanding of signal transduction pathways. The new concepts of feasible t-invariants and MCT-sets have been proven to be useful for model validation and the interpretation of the biological system behaviour. Whereas MCT-sets provide a decomposition of the net into disjunctive subnets, feasible t-invariants describe subnets, which generally overlap. This work contributes to qualitative modelling and to the analysis of large biological networks by their fully automatic decomposition into biologically meaningful modules.
Collapse
|
11
|
Becker SA, Price ND, Palsson BØ. Metabolite coupling in genome-scale metabolic networks. BMC Bioinformatics 2006; 7:111. [PMID: 16519800 PMCID: PMC1420336 DOI: 10.1186/1471-2105-7-111] [Citation(s) in RCA: 28] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/08/2005] [Accepted: 03/06/2006] [Indexed: 11/29/2022] Open
Abstract
Background Biochemically detailed stoichiometric matrices have now been reconstructed for various bacteria, yeast, and for the human cardiac mitochondrion based on genomic and proteomic data. These networks have been manually curated based on legacy data and elementally and charge balanced. Comparative analysis of these well curated networks is now possible. Pairs of metabolites often appear together in several network reactions, linking them topologically. This co-occurrence of pairs of metabolites in metabolic reactions is termed herein "metabolite coupling." These metabolite pairs can be directly computed from the stoichiometric matrix, S. Metabolite coupling is derived from the matrix ŜŜT, whose off-diagonal elements indicate the number of reactions in which any two metabolites participate together, where Ŝ is the binary form of S. Results Metabolite coupling in the studied networks was found to be dominated by a relatively small group of highly interacting pairs of metabolites. As would be expected, metabolites with high individual metabolite connectivity also tended to be those with the highest metabolite coupling, as the most connected metabolites couple more often. For metabolite pairs that are not highly coupled, we show that the number of reactions a pair of metabolites shares across a metabolic network closely approximates a line on a log-log scale. We also show that the preferential coupling of two metabolites with each other is spread across the spectrum of metabolites and is not unique to the most connected metabolites. We provide a measure for determining which metabolite pairs couple more often than would be expected based on their individual connectivity in the network and show that these metabolites often derive their principal biological functions from existing in pairs. Thus, analysis of metabolite coupling provides information beyond that which is found from studying the individual connectivity of individual metabolites. Conclusion The coupling of metabolites is an important topological property of metabolic networks. By computing coupling quantitatively for the first time in genome-scale metabolic networks, we provide insight into the basic structure of these networks.
Collapse
Affiliation(s)
- Scott A Becker
- Department of Bioengineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, California, 92093, USA
| | - Nathan D Price
- Institute for Systems Biology, 1441 North 34th Street, Seattle, Washington, 98103, USA
| | - Bernhard Ø Palsson
- Department of Bioengineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, California, 92093, USA
| |
Collapse
|
12
|
Yu GX, Park BH, Chandramohan P, Munavalli R, Geist A, Samatova NF. In silico discovery of enzyme-substrate specificity-determining residue clusters. J Mol Biol 2005; 352:1105-17. [PMID: 16140329 DOI: 10.1016/j.jmb.2005.08.008] [Citation(s) in RCA: 21] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/21/2005] [Accepted: 08/10/2005] [Indexed: 11/24/2022]
Abstract
The binding between an enzyme and its substrate is highly specific, despite the fact that many different enzymes show significant sequence and structure similarity. There must be, then, substrate specificity-determining residues that enable different enzymes to recognize their unique substrates. We reason that a coordinated, not independent, action of both conserved and non-conserved residues determine enzymatic activity and specificity. Here, we present a surface patch ranking (SPR) method for in silico discovery of substrate specificity-determining residue clusters by exploring both sequence conservation and correlated mutations. As case studies we apply SPR to several highly homologous enzymatic protein pairs, such as guanylyl versus adenylyl cyclases, lactate versus malate dehydrogenases, and trypsin versus chymotrypsin. Without using experimental data, we predict several single and multi-residue clusters that are consistent with previous mutagenesis experimental results. Most single-residue clusters are directly involved in enzyme-substrate interactions, whereas multi-residue clusters are vital for domain-domain and regulator-enzyme interactions, indicating their complementary role in specificity determination. These results demonstrate that SPR may help the selection of target residues for mutagenesis experiments and, thus, focus rational drug design, protein engineering, and functional annotation to the relevant regions of a protein.
Collapse
Affiliation(s)
- Gong-Xin Yu
- Computational Biology Institute, Oak Ridge National Laboratory, P.O. Box 2008, Oak Ridge, TN 37831, USA
| | | | | | | | | | | |
Collapse
|
13
|
Yu GX, Glass EM, Karonis NT, Maltsev N. Knowledge-based voting algorithm for automated protein functional annotation†. Proteins 2005; 61:907-17. [PMID: 16252283 DOI: 10.1002/prot.20652] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022]
Abstract
Automated annotation of high-throughput genome sequences is one of the earliest steps toward a comprehensive understanding of the dynamic behavior of living organisms. However, the step is often error-prone because of its underlying algorithms, which rely mainly on a simple similarity analysis, and lack of guidance from biological rules. We present herein a knowledge-based protein annotation algorithm. Our objectives are to reduce errors and to improve annotation confidences. This algorithm consists of two major components: a knowledge system, called "RuleMiner," and a voting procedure. The knowledge system, which includes biological rules and functional profiles for each function, provides a platform for seamless integration of multiple sequence analysis tools and guidance for function annotation. The voting procedure, which relies on the knowledge system, is designed to make (possibly) unbiased judgments in functional assignments among complicated, sometimes conflicting, information. We have applied this algorithm to 10 prokaryotic bacterial genomes and observed a significant improvement in annotation confidences. We also discuss the current limitations of the algorithm and the potential for future improvement.
Collapse
Affiliation(s)
- G X Yu
- Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, USA.
| | | | | | | |
Collapse
|