๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A graph-theoretic approach to modeling metabolic pathways

โœ Scribed by Eric Gifford; Mark Johnson; Chun-che Tsai


Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
832 KB
Volume
5
Category
Article
ISSN
0920-654X

No coin nor oath required. For personal study only.

โœฆ Synopsis


The metabolic pathways of medazepam, oxazepam, and diazepam were modeled using graph-theoretic transforms which are incorporable into computer-assisted metabolic analysis programs. The information, represented in the form of a graph-theoretic transform kit, which was obtained from these pathways was then used to predict the metabolites of other benzodiazepine compounds. The transform kits gave statistically significant predictions with respect to a statistical method for evaluating the performance of the transform kits.


๐Ÿ“œ SIMILAR VOLUMES


A Graph Theoretic Approach to Switching
โœ Kabekode V.S. Bhat ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 924 KB

## In this paper we pursue the graph theoretic approach to the switching function minimization problem which is still important in view of today's technological innovations such as programmable Logic arrays. We use switching functions graphs (SFG) for studying the structure of switching functions an

A graph theoretic approach to multivaria
โœ C. Schizas; F.J. Evans ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 480 KB

A graph theoretic approach is described for the design of multivariable control for large systems as an alternative to geometric methods. An example is given for a distillation column to demonstrate the technique, with a particular reference to aspects of disturbance rejection and the possibilities

A graph theoretic approach to feed-throu
โœ Y.-P. Chen; D.F. Wong ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 714 KB

We study in this paper the feed-through pin assignment problem for cell-based design that assigns global nets to feedthrough cells or implicit feed-through ports. On a single row, for a restricted permutation of global nets, we develop a graph theoretic approach for optimally minimizing the density