PubMed HealthSearch

PubMed · 1619958

Schematic methods for probabilistic enzyme kinetics.

Abstract

The theory of steady-state enzyme processes which avoids using the mass action law of chemical kinetics and consistently describes catalytic mechanisms by probabilistic concepts has recently been proposed (Mazur, 1991, J. theor. Biol. 148, 229-242). To facilitate the analysis of complex reaction graphs by this theory the possibility of constructing schematic rules similar to those used in classical kinetics is studied. It is found that due to the similarity of algebraic procedures the popular method of King & Altman can be applied in probabilistic kinetics in addition to the earlier proposed rule based on enumeration of cycles of the reaction graph. This similarity also allows one to adapt many other shortcut methods of classical kinetics for probabilistic reaction graphs. The paper considers separately the possibility of transforming reaction mechanisms so that the initial graph is replaced by a simpler but equivalent one. It is shown that there are few cases when a group of states can be replaced by one united state, with earlier known rules such as the rule of Cha for equilibrium stages being particular cases of a more general procedure. In addition a novel method is proposed which performs step-by-step reduction of any reaction graph. All the new methods can be adapted for traditional kinetics as well. The results obtained demonstrate that many schematic rules of classical kinetics are of probabilistic origin.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A K Mazur, A V Kuchinski. 1992-04-07. Schematic methods for probabilistic enzyme kinetics.. https://doi.org/10.1016/s0022-5193(05)80605-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

How not to be seen: predicting unseen enzyme functions using contrastive learning.

MOTIVATION: Predicting enzyme function from its sequence is still an unsolved problem in the life sciences. Moreover, with the explosion of annotated genome data, we are inundated with potential enzymatic sequences that have not yet been biochemically characterized. While it is not possible to assign a not-yet-existing label to such a sequence, there is high value in placing the sequence as accurately as possible in known function space. Doing so can help provide more accurate falsifiable hypotheses for experimentalists wishing to characterize enzymes from specific functional families. RESULTS: Here we present a contrastive learning algorithm for predicting enzyme function from sequence. Our method, EnzPlacer, predicts the third, second, and first EC numbers for a protein whose fourth EC number is not in the training corpus. This novel prediction mechanism accurately places a protein sequence within a narrowed-down functional context, even if the precise function remains unknown. AVAILABILITY AND IMPLEMENTATION: EnzPlacer and data is available at https://github.com/drxiangma/EnzPlacer under a GPL3 license.

Enzymes