MPS: An artificially intelligent software system for the analysis and synthesis of metabolic pathways

The concepts of artificial intelligence have been applied for the development of a software system for metabolic pathway synthesis (MPS). An easily expandable data base system for storing enzyme and substance descriptions is used by a search algorithm for the identification of possible ways to interconvert carbon‐carrying metabolites. A versatile screening capability permits the user to identify all pathways which contain or exclude any combination of enzymes, substrates, and/or products. Information provided by MPS can be used to predict on a qualitative basis the effects of adding or deleting enzymatic activities to or from the cellular environment, to classify pathways with respect to cellular objectives, and to extract information about metabolic regulation. MPS can be used subsequently to aid the identification of appropriate genotypes or genetic modifications that will redirect metabolism towards amplified production of desirable bioproducts. Two examples illustrating the capabilities of MPS are presented. In the first example, which considers the conversion of glucose 6‐phosphate to pyruvate, MPS synthesized the classical catabolic pathways (EMP, pentose phosphate and ED) along with possible variations. A route for the biosynthesis of L‐alanine that does not incorporate the enzyme alanine aminotransferase was revealed by MPS during synthesis of alternative pathways which produce L‐alanine from pyruvate.

[1]  Herbert A. Simon,et al.  Search and Reasoning in Problem Solving , 1983, Artif. Intell..

[2]  George Stephanopoulos,et al.  Synthesis in process development , 1986 .

[3]  James R. Slagle,et al.  An Admissible and Optimal Algorithm for Searching AND/OR Graphs , 1971, Artif. Intell..

[4]  Thomas H. Pierce,et al.  Artificial intelligence applications in chemistry , 1986 .

[5]  M. M. Newborn,et al.  The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores , 1977, Artif. Intell..

[6]  Vipin Kumar,et al.  A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures , 1983, Artif. Intell..

[7]  Bruce W. Ballard,et al.  The *-Minimax Search Procedure for Trees Containing Chance Nodes , 1983, Artif. Intell..

[8]  Michael P. Georgeff,et al.  Procedural Control in Production Systems , 1982, Artif. Intell..

[9]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[10]  D. H. Rouvray,et al.  Isomer enumeration methods , 1974 .

[11]  John P. Fishburn,et al.  Parallelism in Alpha-Beta Search , 1982, Artif. Intell..

[12]  Toshihide Ibaraki,et al.  Generalization of Alpha-Beta and SSS Search Procedures , 1986, Artif. Intell..

[13]  R Fugmann,et al.  Theoretical aspects of communication in chemistry. , 1970, Angewandte Chemie.

[14]  Bruce Randall Donald,et al.  A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..

[15]  F. Westheimer.  Why nature chose phosphates. , 1987, Science.

[16]  E. J. Corey,et al.  Algorithm for machine perception of synthetically significant rings in complex cyclic organic structures , 1972 .

[17]  T. Anthony Marsland,et al.  A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..

[18]  Giorgio Levi,et al.  Generalized AND/OR Graphs , 1976, Artif. Intell..

[19]  Richard M. Karp,et al.  Searching for an Optimal Path in a Tree with Random Costs , 1983, Artif. Intell..

[20]  Barr and Feigenbaum Edward A. Avron,et al.  The Handbook of Artificial Intelligence , 1981 .

[21]  George Stephanopoulos,et al.  Artificial intelligence in the development and design of biochemical processes , 1986 .

[22]  J. A. Roels,et al.  Simple model for the energetics of growth on substrates with different degrees of reduction , 1980 .

[23]  M M Domach,et al.  Computer model for glucose‐limited growth of a single cell of Escherichia coli B/r‐A , 1984, Biotechnology and bioengineering.

[24]  Herbert A. Simon,et al.  Optimal Problem-Solving Search: All-Oor-None Solutions , 1975, Artif. Intell..