Dataset Information

The partition representation of enzymatic reaction networks and its application for searching bi-stable reaction systems.

ABSTRACT: The signal transduction system, which is known as a regulatory mechanism for biochemical reaction systems in the cell, has been the subject of intensive research in recent years, and its design methods have become necessary from the viewpoint of synthetic biology. We proposed the partition representation of enzymatic reaction networks consisting of post-translational modification reactions such as phosphorylation, which is an important basic component of signal transduction systems, and attempted to find enzymatic reaction networks with bistability to demonstrate the effectiveness of the proposed representation method. The partition modifiers can be naturally introduced into the partition representation of enzymatic reaction networks when applied to search. By randomly applying the partition modifiers as appropriate, we searched for bistable and resettable enzymatic reaction networks consisting of four post-translational modification reactions. The proposed search algorithm worked well and we were able to find various bistable enzymatic reaction networks, including a typical bistable enzymatic reaction network with positive auto-feedbacks and mutually negative regulations. Since the search algorithm is divided into an evaluation function specific to the characteristics of the enzymatic reaction network to be searched and an independent algorithm part, it may be applied to search for dynamic properties such as biochemical adaptation, the ability to reset the biochemical state after responding to a stimulus, by replacing the evaluation function with one for other characteristics.

SUBMITTER: Naka T

PROVIDER: S-EPMC8791506 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:MotivationThe growing complexity of reaction-based models necessitates early detection and resolution of model errors. Considerable work has been done on the detection of mass balance errors, especially atomic mass analysis (AMA) (which compares the counts of atoms in the reactants and products) and Linear Programming analysis (which detects stoichiometric inconsistencies). This article extends model error checking to include: (i) certain structural errors in reaction networks and (ii) error isolation. First, we consider the balance of chemical structures (moieties) between reactants and products. This balance is expected in many biochemical reactions, but the imbalance of chemical structures cannot be detected if the analysis is done in units of atomic masses. Second, we improve on error isolation for stoichiometric inconsistencies by identifying a small number of reactions and/or species that cause the error. Doing so simplifies error remediation.ResultsWe propose two algorithms that address isolating structural errors in reaction networks. Moiety analysis finds imbalances of moieties using the same algorithm as AMA, but moiety analysis works in units of moieties instead of atomic masses. We argue for the value of checking moiety balance, and discuss two approaches to decomposing chemical species into moieties. Graphical Analysis of Mass Equivalence Sets (GAMES) provides isolation for stoichiometric inconsistencies by constructing explanations that relate errors in the structure of the reaction network to elements of the reaction network. We study the effectiveness of moiety analysis and GAMES on curated models in the BioModels repository. We have created open source codes for moiety analysis and GAMES.Availability and implementationOur project is hosted at https://github.com/ModelEngineering/SBMLLint, which contains examples, documentation, source code files and build scripts used to create SBMLLint. Our source code is licensed under the MIT open source license.Supplementary informationSupplementary data are available at Bioinformatics online.

Project description:BackgroundIdentification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases structure-sequence or profile/family-sequence alignment programs become difficult to apply because of unreliable RNA structures or family alignments. As such, local sequence-sequence alignment programs are frequently used instead. We have recently demonstrated that maximal expected accuracy alignments using partition function match probabilities (implemented in Probalign) are significantly better than contemporary methods on heterogeneous length protein sequence datasets, thus suggesting an affinity for local alignment.ResultsWe create a pairwise RNA-genome alignment benchmark from RFAM families with average pairwise sequence identity up to 60%. Each dataset contains a query RNA aligned to a target RNA (of the same family) embedded in a genomic sequence at least 5K nucleotides long. To simulate common conditions when exact ends of an ncRNA are unknown, each query RNA has 5' and 3' genomic flanks of size 50, 100, and 150 nucleotides. We subsequently compare the error of the Probalign program (adjusted for local alignment) to the commonly used local alignment programs HMMER, SSEARCH, and BLAST, and the popular ClustalW program with zero end-gap penalties. Parameters were optimized for each program on a small subset of the benchmark. Probalign has overall highest accuracies on the full benchmark. It leads by 10% accuracy over SSEARCH (the next best method) on 5 out of 22 families. On datasets restricted to maximum of 30% sequence identity, Probalign's overall median error is 71.2% vs. 83.4% for SSEARCH (P-value < 0.05). Furthermore, on these datasets Probalign leads SSEARCH by at least 10% on five families; SSEARCH leads Probalign by the same margin on two of the fourteen families. We also demonstrate that the Probalign mean posterior probability, compared to the normalized SSEARCH Z-score, is a better discriminator of alignment quality. All datasets and software are available online.ConclusionWe demonstrate, for the first time, that partition function match probabilities used for expected accuracy alignment, as done in Probalign, provide statistically significant improvement over current approaches for identifying distantly related RNA sequences in larger genomic segments.

Dataset Information

The partition representation of enzymatic reaction networks and its application for searching bi-stable reaction systems.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets