## Finding Precursor Compounds in Secondary Metabolism (1999)

Venue: | Genome Informatics |

Citations: | 1 - 1 self |

### BibTeX

@ARTICLE{Arita99findingprecursor,

author = {Masanori Arita and Kiyoshi Asai and Takaaki Nishioka},

title = {Finding Precursor Compounds in Secondary Metabolism},

journal = {Genome Informatics},

year = {1999},

volume = {10}

}

### OpenURL

### Abstract

A precursor is a compound which is transformed to a class of functional molecules within short steps. It is an important process in the production of natural drugs to decide whether a given compound is a precursor or not. We present two strategies to select precursor compounds in the secondary metabolism of terpenoids: one is to find the packing of basic molecules in the given cyclic structure, and the other is to find the synthetic map of the given set of compounds. Both strategies play important roles in reproducing tracer experiments on a computer. 1 Introduction Finding the biosynthetic pathway of a hormone or a natural drug is the key issue for its industrial production. Even a limited increase in its production rate may lead to a drastic change in the synthetic scheme at a commercial level, because of its very low yield from raw materials. For example, the average yield of paclitaxel (a recently approved anticancer drug) from the yew bark is in the range of 0.014--0.017%. ...

### Citations

8530 |
Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ... shall discuss how to apply the minimum spanning tree (MST) algorithm to find the metabolic pathway of a given set of compounds. MST algorithm is one of the classics introduced in many textbooks (See =-=[5] f-=-or the algorithmic detail.). It is considered useful in finding biosynthetic pathways for the following reasons. • It groups compounds in the order of similarity until all the compounds are grouped ... |

637 | LEDA: A platform for combinatorial and geometric computing
- Mehlhorn, Naher
- 1995
(Show Context)
Citation Context ...e size of T is linear in the size of G, each iteration of the dynamic programming takes a linear time in the size of G. 2.1 Performance The algorithm is implemented in C ++ using LEDA library package =-=[12]-=-. Several sterols are tested for the possibility of isoprene packing. To our surprise, very few of them can be completely dissected into 1 There are very few exceptions such as lignin. Lignin is forme... |

155 | Kanehisa M: KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Res
- Ogata, Goto, et al.
- 1999
(Show Context)
Citation Context ...ble 1. The distance for each conversion is the reciprocal of its occurrences (frequency) in the 86 reactions in C21-Steroid Hormone metabolism and in Androgen and Estrogen metabolism of KEGG database =-=[13]. Fo-=-r example, the reaction “/ =O” appears in 38 reactions, 86 divided by 38 makes 2.3. 3.2 MST Performance We apply MST algorithm to the obtained graph G. Interestingly, the compounds appearing in ab... |

58 |
A polynomial-time algorithm to find the shortest cycle basis of a graph
- Horton
- 1987
(Show Context)
Citation Context ...en the resulting tree and the pattern tree to find the maximum number of pattern trees, disjointly packed in the structure. The first step, the detection of cycles, is performed by Horton’s algorith=-=m [9]-=-. Its original purpose is to find a minimum cycle basis, and the final Gaussian elimination is required to remove such cycles that can be represented as a conjugation of smaller cycles. This step domi... |

47 |
Linear-time computation of optimal subgraphs of decomposable graphs
- Bern, Lawler, et al.
- 1987
(Show Context)
Citation Context ... for some restricted class of graph, it can be computed in linear-time [14]. It is known that such efficiency can be achieved by decomposing the graph G into a tree, followed by a dynamic programming =-=[4]-=-. Chemical structures do not confine themselves in a well-behaving class of graphs, but the number of cycles is limited, and the degree of nodes is bounded. Moreover, we only need to consider a case (... |

42 |
On the completeness of a generalized matching problem
- Kirkpatrick, Hell
- 1978
(Show Context)
Citation Context ...ven a graph G and a fixed pattern graph H, one wants to determine the maximum number of vertex-disjoint copies of H in G. The problem is known to be NP-complete if H contains more than three vertices =-=[10]-=-, but for some restricted class of graph, it can be computed in linear-time [14]. It is known that such efficiency can be achieved by decomposing the graph G into a tree, followed by a dynamic program... |

39 |
Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs
- Takamizawa, Nishizeki, et al.
- 1982
(Show Context)
Citation Context ...mber of vertex-disjoint copies of H in G. The problem is known to be NP-complete if H contains more than three vertices [10], but for some restricted class of graph, it can be computed in linear-time =-=[14]-=-. It is known that such efficiency can be achieved by decomposing the graph G into a tree, followed by a dynamic programming [4]. Chemical structures do not confine themselves in a well-behaving class... |

18 | Finding the k smallest spanning trees
- Eppstein
- 1990
(Show Context)
Citation Context ...mpounds are grouped to a single set. This is the same process as what expert biologists intuitively do in reconstructing pathways. • There are efficient algorithms for computing sub-optimal solution=-=s [6]. Gi-=-ven a set of compounds, we compute the structural similarity of all the pair of compounds in it. From this all-to-all comparison, we can determine the difference or ‘distance’ between any two terp... |

4 |
A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree
- Akutsu
- 1993
(Show Context)
Citation Context ... solved in linear time 2 , and the total computational time becomes polynomial, if the number of cycles and the degree are bounded. This strategy is proven to be a polynomial-time algorithm by Akutsu =-=[1]-=-. Pattern-Packing algorithm 1. Locate small cycles in the structure. Let the number of cycles be k. 2. Delete k edges, one for each cycle, in a combinatorial manner. Apply the dynamic programming betw... |

2 |
Automated metabolic reconstruction: theory and experiments
- Arita
- 1999
(Show Context)
Citation Context ...R Project Both algorithms are implemented in the Automated Metabolic Reconstruction (AMR) project, whose aim is the prediction of unknown or alternative metabolic pathways by computational simulation =-=[3]-=-. Its next major step is to formalize unknown enzymatic reactions. It seems impossible to predict a function of totally unique and novel enzymes, but most enzymes perform basic reactions such as oxida... |

2 |
Tour de paclitaxel: Biocatalysis for semisynthesis
- Patel
(Show Context)
Citation Context ...terials. For example, the average yield of paclitaxel (a recently approved anticancer drug) from the yew bark is in the range of 0.014–0.017%. About 7.5kg of bark is required to produce 1g paclitaxe=-=l [11]-=-. When compared with the metabolism of nucleotides and amino acids, the metabolism of such a compound, called the secondary metabolism, is much less known. Since most drugs are synthesized in a specie... |

1 |
Graph modeling of biological mechanisms
- Arita
(Show Context)
Citation Context ... No. conversion score 1: /=O 2.3 3: / -CR 14.3 2: =O / -OH 3.2 4: -C=C- / -C-C- 6.6 5: -OH/ -OX 12.3 1. Given two structures, compute their maximum common substructure using a branch-and-bound method =-=[2]-=-. 2. Identify the chemical groups modified between them, and sums up the penalty score according to Table 1. This summed score is the edge distance between the two structures. The reactions occurring ... |

1 |
Taxol biosynthesis: an update
- Hezari, Croteau
- 1997
(Show Context)
Citation Context ...forms. Second, a precursor is less oxidized, because oxidation generally occurs during the degradation process. These criteria are exemplified in the estimation of the synthetic pathway of paclitaxel =-=[8]-=-. We shall discuss how to apply the minimum spanning tree (MST) algorithm to find the metabolic pathway of a given set of compounds. MST algorithm is one of the classics introduced in many textbooks (... |