Quantitative analysis of metabolic regulation. A graph-theoretic approach using spanning trees.
Ontology highlight
ABSTRACT:
SUBMITTER: Sen AK
PROVIDER: S-EPMC1150040 | biostudies-other | 1991 Apr
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Within the premises of the flux-oriented theory of Crabtree & Newsholme [(1987) Biochem. J. 247, 113-120], I have used a graph-theoretic approach for calculating the Control Coefficients of metabolic pathways. It is shown that a directed graph representing the control structure of a metabolic pathway can be constructed in a heuristic manner directly from the reaction diagram of the pathway, without the necessity of writing down the governing equations for the Control Coefficients. The Control Coefficients are derived from an analysis of the topology of the directed graph. The graph-theoretic approach also provides a visual framework for analysing the functional relationships of the individual enzymes. The control structures of the following pathways are examined here: (a) a simple unbranched pathway with four enzymes, (b) a simple branched pathway with three enzymes, and (c) a branched pathway with both carbon and energy (ATP) fluxes.
| S-EPMC1151546 | biostudies-other
Project description:A fuel cell, an energy conversion system, needs analysis for its performance at the design and off-design point conditions during its real-time operation. System performance evaluation with logical methodology is helpful in decision-making while considering efficiency and cross-correlated parameters in fuel cells. This work presents an overview and categorization of different fuel cells, leading to the developing of a method combining graph theory and matrix method for analyzing fuel cell system structure to make more informed decisions. The fuel cell system is divided into four interdependent sub-systems. The methodology developed in this work consists of a series of steps comprised of digraph representation, matrix representation, and permanent function representation. A mathematical model is evaluated quantitatively to produce a performance index numerical value. With the aid of case studies, the proposed methodology is explained, and the advantages of the proposed method are corroborated.
| S-EPMC10495936 | biostudies-literature
Project description:BackgroundA biochemical mechanism with mass action kinetics can be represented as a directed bipartite graph (bipartite digraph), and modeled by a system of differential equations. If the differential equations (DE) model can give rise to some instability such as multistability or Turing instability, then the bipartite digraph contains a structure referred to as a critical fragment. In some cases the existence of a critical fragment indicates that the DE model can display oscillations for some parameter values. We have implemented a graph-theoretic method that identifies the critical fragments of the bipartite digraph of a biochemical mechanism.ResultsGraTeLPy lists all critical fragments of the bipartite digraph of a given biochemical mechanism, thus enabling a preliminary analysis on the potential of a biochemical mechanism for some instability based on its topological structure. The correctness of the implementation is supported by multiple examples. The code is implemented in Python, relies on open software, and is available under the GNU General Public License.ConclusionsGraTeLPy can be used by researchers to test large biochemical mechanisms with mass action kinetics for their capacity for multistability, oscillations and Turing instability.
| S-EPMC4016541 | biostudies-literature
Project description:Graph theory-based approaches are efficient tools for detecting clustering and group-wise differences in high-dimensional data across a wide range of fields, such as gene expression analysis and neural connectivity. Here, we examine data from a cross-sectional, resting-state magnetoencephalography study of 89 Parkinson's disease patients, and use minimum-spanning tree (MST) methods to relate severity of Parkinsonian cognitive impairment to neural connectivity changes. In particular, we implement the two-sample multivariate-runs test of Friedman and Rafsky (Ann Stat 7(4):697-717, 1979) and find it to be a powerful paradigm for distinguishing highly significant deviations from the null distribution in high-dimensional data. We also generalize this test for use with greater than two classes, and show its ability to localize significance to particular sub-classes. We observe multiple indications of altered connectivity in Parkinsonian dementia that may be of future use in diagnosis and prediction.
| S-EPMC8492620 | biostudies-literature
Project description:BackgroundClustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples are based on distance metrics utilizing all genes. This has the effect of obscuring clustering in samples that may be evident only when looking at a subset of genes, because noise from irrelevant genes dominates the signal from the relevant genes in the distance calculation.ResultsWe describe an algorithm for automatically detecting clusters of samples that are discernable only in a subset of genes. We use iteration between Minimal Spanning Tree based clustering and feature selection to remove noise genes in a step-wise manner while simultaneously sharpening the clustering. Evaluation of this algorithm on synthetic data shows that it resolves planted clusters with high accuracy in spite of noise and the presence of other clusters. It also shows a low probability of detecting spurious clusters. Testing the algorithm on some well known micro-array data-sets reveals known biological classes as well as novel clusters.ConclusionsThe iterative clustering method offers considerable improvement over clustering in all genes. This method can be used to discover partitions and their biological significance can be determined by comparing with clinical correlates and gene annotations. The MATLAB programs for the iterative clustering algorithm are available from http://linus.nci.nih.gov/supplement.html
| S-EPMC520744 | biostudies-literature
Project description:For many species, multiple maps are available, often constructed independently by different research groups using different sets of markers and different source material. Integration of these maps provides a higher density of markers and greater genome coverage than is possible using a single study. In this article, we describe a novel approach to comparing and integrating maps by using abstract graphs. A map is modeled as a directed graph in which nodes represent mapped markers and edges define the order of adjacent markers. Independently constructed graphs representing corresponding maps from different studies are merged on the basis of their common loci. Absence of a path between two nodes indicates that their order is undetermined. A cycle indicates inconsistency among the mapping studies with regard to the order of the loci involved. The integrated graph thus produced represents a complete picture of all of the mapping studies that comprise it, including all of the ambiguities and inconsistencies among them. The objective of this representation is to guide additional research aimed at interpreting these ambiguities and inconsistencies in locus order rather than presenting a "consensus order" that ignores these problems.
| S-EPMC1462874 | biostudies-other
Project description:BACKGROUND: Transmembrane ?-barrel proteins are a special class of transmembrane proteins which play several key roles in human body and diseases. Due to experimental difficulties, the number of transmembrane ?-barrel proteins with known structures is very small. Over the years, a number of learning-based methods have been introduced for recognition and structure prediction of transmembrane ?-barrel proteins. Most of these methods emphasize on homology search rather than any biological or chemical basis. RESULTS: We present a novel graph-theoretic model for classification and structure prediction of transmembrane ?-barrel proteins. This model folds proteins based on energy minimization rather than a homology search, avoiding any assumption on availability of training dataset. The ab initio model presented in this paper is the first method to allow for permutations in the structure of transmembrane proteins and provides more structural information than any known algorithm. The model is also able to recognize ?-barrels by assessing the pseudo free energy. We assess the structure prediction on 41 proteins gathered from existing databases on experimentally validated transmembrane ?-barrel proteins. We show that our approach is quite accurate with over 90% F-score on strands and over 74% F-score on residues. The results are comparable to other algorithms suggesting that our pseudo-energy model is close to the actual physical model. We test our classification approach and show that it is able to reject ?-helical bundles with 100% accuracy and ?-barrel lipocalins with 97% accuracy. CONCLUSIONS: We show that it is possible to design models for classification and structure prediction for transmembrane ?-barrel proteins which do not depend essentially on training sets but on combinatorial properties of the structures to be proved. These models are fairly accurate, robust and can be run very efficiently on PC-like computers. Such models are useful for the genome screening.
| S-EPMC3394416 | biostudies-literature
Project description:All-atom molecular dynamics simulations combined with graph-theoretic analysis reveal that clustering of monomethyl phosphate dianion (MMP2-) is strongly influenced by the types and combinations of cations in the aqueous solution. Although Ca2+ promotes the formation of stable and large MMP2- clusters, K+ alone does not. Nonetheless, clusters are larger and their link lifetimes are longer in mixtures of K+ and Ca2+. This "synergistic" effect depends sensitively on the Lennard-Jones interaction parameters between Ca2+ and the phosphorus oxygen and correlates with the hydration of the clusters. The pronounced MMP2- clustering effect of Ca2+ in the presence of K+ is confirmed by Fourier transform infrared spectroscopy. The characterization of the cation-dependent clustering of MMP2- provides a starting point for understanding cation-dependent clustering of phosphoinositides in cell membranes.
| S-EPMC6322214 | biostudies-literature
Project description:Opinion formation cannot be modeled solely as an ideological deduction from a set of principles; rather, repeated social interactions and logic constraints among statements are consequential in the construct of belief systems. We address three basic questions in the analysis of social opinion dynamics: (i) Will a belief system converge? (ii) How long does it take to converge? (iii) Where does it converge? We provide graph-theoretic answers to these questions for a model of opinion dynamics of a belief system with logic constraints. Our results make plain the implicit dependence of the convergence properties of a belief system on the underlying social network and on the set of logic constraints that relate beliefs on different statements. Moreover, we provide an explicit analysis of a variety of commonly used large-scale network models.
| S-EPMC6586829 | biostudies-literature
Project description:It is well known that the development of cancer is caused by the accumulation of somatic mutations within the genome. For oncogenes specifically, current research suggests that there is a small set of "driver" mutations that are primarily responsible for tumorigenesis. Further, due to recent pharmacological successes in treating these driver mutations and their resulting tumors, a variety of approaches have been developed to identify potential driver mutations using methods such as machine learning and mutational clustering. We propose a novel methodology that increases our power to identify mutational clusters by taking into account protein tertiary structure via a graph theoretical approach.We have designed and implemented GraphPAC (Graph Protein Amino acid Clustering) to identify mutational clustering while considering protein spatial structure. Using GraphPAC, we are able to detect novel clusters in proteins that are known to exhibit mutation clustering as well as identify clusters in proteins without evidence of prior clustering based on current methods. Specifically, by utilizing the spatial information available in the Protein Data Bank (PDB) along with the mutational data in the Catalogue of Somatic Mutations in Cancer (COSMIC), GraphPAC identifies new mutational clusters in well known oncogenes such as EGFR and KRAS. Further, by utilizing graph theory to account for the tertiary structure, GraphPAC discovers clusters in DPP4, NRP1 and other proteins not identified by existing methods. The R package is available at: http://bioconductor.org/packages/release/bioc/html/GraphPAC.html.GraphPAC provides an alternative to iPAC and an extension to current methodology when identifying potential activating driver mutations by utilizing a graph theoretic approach when considering protein tertiary structure.
| S-EPMC4024121 | biostudies-literature