Let X be an n-element set and 2' be the family of subsets of X. If&C c 2' such that for any K. K\_ F .%'" K. f K\_ it-dim K. ct K. then Wr is ca!!pd a Sn~rtwr wstem Let \_M be 8~ ,+\_ x g \_\_l'\_\_L-~" '\_\_I , \_\_' \_\_\_\_=\_\_ \_\_ \_\_I i \_\_' \_ .
Simulation of enzyme systems using a matrix representation
โ Scribed by Sylvan B. Green; David Garfinkel
- Publisher
- Elsevier Science
- Year
- 1970
- Tongue
- English
- Weight
- 496 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0010-4809
No coin nor oath required. For personal study only.
โฆ Synopsis
A program for the simulation of the steady-state behavior of an enzyme by matrix manipulation of the appropriate algebraic equations is described. This permits the calculation of the reaction velocity and of the distribution of the enzyme among its several complex forms. Provision is made for conveniently displaying the results (especially on scope displays) in the forms customarily used by enzyme kineticists. A complicated example is simulated, and applications to teaching and to simulation of multienzyme systems are discussed.
๐ SIMILAR VOLUMES
In this paper, a practical method is presented that allows for the compact representation of sparse matrices. We have employed some random hash functions and applied the rehash technique to the compression of sparse matrices. Using our method, a large-scale sparse matrix can be compressed into some