Omega-Hydroxylation of acyclic monoterpene alcohols by rat lung microsomes

Rat lung microsomes were shown to �-hydroxylate acyclic monoterpene alcohols in the presence of NADPH and O2. NADH could neither support hydroxylation efficiently nor did it show synergistic effect. The hydroxylase activity was greater in microsomes prepared from β-naphthoflavone (BNF)-treated rats than from phenobarbital (PB)-treated or control microsomal preparations. Hydroxylation was specific to the C-8 position in geraniol and has a pH optimum of 7.8. The inhibition of the hydroxylase activity by SKF-525A, CO, N-ethylmaleimide, ellipticine, α-naphthoflavone, cyt. Image and p-CMB indicated the involvement of the cyt. P-450 system. However, NaN3 stimulated the hydroxylase activity to a significant level. Rat kidney microsomes were also capable of �-hydroxylating geraniol although the activity was lower than that observed with lungs.

Omega-hydroxylation of acyclic monoterpene alcohols by rat lung microsomes

Rat lung microsomes were shown to ω-hydroxylate acyclic monoterpene alcohols in the presence of NADPH and O2. NADH could neither support hydroxylation efficiently nor did it show synergistic effect. The hydroxylase activity was greater in microsomes prepared from β-naphthoflavone (BNF)-treated rats than from phenobarbital (PB)-treated or control microsomal preparations. Hydroxylation was specific to the C-8 position in geraniol and has a pH optimum of 7.8. The inhibition of the hydroxylase activity by SKF-525A, CO, N-ethylmaleimide, ellipticine, α-naphthoflavone, cyt. Image and p-CMB indicated the involvement of the cyt. P-450 system. However, NaN3 stimulated the hydroxylase activity to a significant level. Rat kidney microsomes were also capable of ω-hydroxylating geraniol although the activity was lower than that observed with lungs.

Regiospecific hydroxylation of acyclic monoterpene alcohols by aspergillus_niger

Aspergillus niger was shown to carry out the regiospecific hydroxylation of acyclic monoterpene alcohols.

Linalyl Acetate Is Metabolized by Pseudomonas incognita with the Acetoxy Group Intact

Metabolism of linalyl acetate by Pseudomonas incognita isolated by enrichment culture on the acyclic monoterpene alcohol linalool was studied. Biodegradation of linalyl acetate by this strain resulted in the formation of linalool, linalool- 8-carboxylic acid, oleuropeic acid, and A5-4-acetoxy-4-methyl hexenoic acid. Cells adapted to linalyl acetate metabolized linalyl acetate-8-aldehyde to linalool- 8-carboxylic acid, linalyl acetate-8-carboxylic acid, A5-4-acetoxy-4-methyl hexenoic acid, and geraniol-8-carboxylic acid. Resting cell suspensions previously grown with linalyl acetate oxidized linalyl acetate-8-aldehyde to linalyl acetate-8- carboxylic acid, A5-4-acetoxy-4-methyl hexenoic acid, and pyruvic acid. The crude cell-free extract (10,000 g of supernatant), obtained from the sonicate of linalyl acetate-grown cells, was shown to contain enzyme systems responsible for the formation of linalyl acetate-8-carboxylic acid and linalool-8-carboxylic acid from linalyl acetate. The same supernatant contained NAD-linked alcohol and aldehyde dehydrogenases involved in the formation of linalyl acetate-8-aldehyde and linalyl acetate-8-carboxylic acid, respectively. On the basis of various metabolites isolated from the culture medium, resting cell experiments, growth and manometric studies carried out with the isolated metabolites as well as related synthetic analogs, and the preliminary enzymatic studies performed with the cellfree extract, a probable pathway for the microbial degradation of linalyl acetate with the acetoxy group intact is suggested.

Efficacy of geraniol but not of β-ionone or their combination for the chemoprevention of rat colon carcinogenesis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Geraniol-a flavoring agent with multifunctional effects in protecting the gastric and duodenal mucosa

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Avicins: Triterpenoid saponins from Acacia victoriae (Bentham) induce apoptosis by mitochondrial perturbation

Anticancer agents target various subcellular components and trigger apoptosis in chemosensitive cells. We have recently reported the tumor cell growth inhibitory properties of a mixture of triterpenoid saponins obtained from an Australian desert tree (Leguminosae) Acacia victoriae (Bentham). Here we report the purification of this mixture into two biologically pure components called avicins that contain an acacic acid core with two acyclic monoterpene units connected by a quinovose sugar. We demonstrate that the mixture of triterpenoid saponins and avicins induce apoptosis in the Jurkat human T cell line by affecting the mitochondrial function. Avicin G induced cytochrome c release within 30–120 min in whole cells and within a minute in the cell-free system. Caspase inhibitors DEVD or zVAD-fmk had no effect on cytochrome c release, suggesting the direct action of avicin G on the mitochondria. Activation of caspase-3 and total cleavage of poly(ADP-ribose) polymerase (PARP) occurred between 2 and 6 h posttreatment with avicins by zVAD-fmk. Interestingly, in the treated cells no significant changes in the membrane potential preceded or accompanied cytochrome c release. A small decrease in the generation of reactive oxygen species (ROS) was measured. The study of these evolutionarily ancient compounds may represent an interesting paradigm for the application of chemical ecology and chemical biology to human health.

De novo biosynthesis of the aggregation pheromone components ipsenol and ipsdienol by the pine bark beetles Ips paraconfusus Lanier and Ips pini (Say) (Coleoptera: Scolytidae).

The California five-spined ips, Ips paraconfusus Lanier, produces the myrcene-derived acyclic monoterpene alcohols ipsenol (2-methyl-6-methylene-7-octen-4-ol) and ipsdienol (2-methyl-6-methylene-2,7-octadien-4-ol) as components of its aggregation pheromone. The pine engraver beetle, Ips pini (Say), produces only ipsdienol. Previous studies have shown that myrcene, a monoterpene in the pines colonized by these beetles, is a direct precursor to these pheromone components. In vivo radiolabeling studies reported here showed that male I. paraconfusus incorporated [1-14C]acetate into ipsenol, ipsdienol, and amitinol (trans-2-methyl-6-methylene-3,7-octadien-2-ol), while male I. pini incorporated [1-14C]acetate into ipsdienol and amitinol. Females of these species produced neither labeled nor unlabeled pheromone components. The purified radiolabeled monoterpene alcohols from-males were identified by comparison of their HPLC and GC retention times with those of unlabeled standards. HPLC-purified fractions containing the individual radiolabeled components were analyzed by GC-MS and were shown to include only the pure alcohols. To further confirm that ipsdienol and ipsenol were radiolabeled, diastereomeric ester derivatives of the isolated alcohols were synthesized and analyzed by HPLC and GC-MS. After derivatization of the radiolabeled alcohols, the HPLC analysis demonstrated expected shifts in retention times with conservation of naturally occurring stereochemistry. The results provide direct evidence for de novo biosynthesis of ipsenol, ipsdienol, and amitinol by bark beetles.

Maximal structuring of acyclic process models

This article addresses the transformation of a process model with an arbitrary topology into an equivalent structured process model. In particular, this article studies the subclass of process models that have no equivalent well-structured representation but which, nevertheless, can be partially structured into their maximally-structured representation. The transformations are performed under a behavioral equivalence notion that preserves the observed concurrency of tasks in equivalent process models. The article gives a full characterization of the subclass of acyclic process models that have no equivalent well-structured representation, but do have an equivalent maximally-structured one, as well as proposes a complete structuring method. Together with our previous results, this article completes the solution of the process model structuring problem for the class of acyclic process models.

Structuring acyclic process models

This article studies the problem of transforming a process model with an arbitrary topology into an equivalent well-structured process model. While this problem has received significant attention, there is still no full characterization of the class of unstructured process models that can be transformed into well-structured ones, nor an automated method for structuring any process model that belongs to this class. This article fills this gap in the context of acyclic process models. The article defines a necessary and sufficient condition for an unstructured acyclic process model to have an equivalent well-structured process model under fully concurrent bisimulation, as well as a complete structuring method. The method has been implemented as a tool that takes process models captured in the BPMN and EPC notations as input. The article also reports on an empirical evaluation of the structuring method using a repository of process models from commercial practice.

On separation of concurrency and conflicts in acyclic process models

Recently, a new approach for structuring acyclic process models has been introduced. The algorithm is based on a transformation between the Refined Process Structure Tree (RPST) of a control flow graph and the Modular Decomposition Tree (MDT) of ordering relations. In this paper, an extension of the algorithm is presented that allows to partially structure process models in the case when a process model cannot be structured completely. We distinguish four different types of unstructuredness of process models and show that only two are possible in practice. For one of these two types of unstructuredness an algorithm is proposed that returns the maximally structured representation of a process model.

Structuring acyclic process models

This paper addresses the problem of transforming a process model with an arbitrary topology into an equivalent well-structured process model. While this problem has received significant attention, there is still no full characterization of the class of unstructured process models that can be transformed into well-structured ones, nor an automated method to structure any process model that belongs to this class. This paper fills this gap in the context of acyclic process models. The paper defines a necessary and sufficient condition for an unstructured process model to have an equivalent structured model under fully concurrent bisimulation, as well as a complete structuring method.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

Binary decompositions and acyclic schemes

It is well known that the notions of normal forms and acyclicity capture many practical desirable properties for database schemes. The basic schema design problem is to develop design methodologies that strive toward these ideals. The usual approach is to first normalize the database scheme as far as possible. If the resulting scheme is cyclic, then one tries to transform it into an acyclic scheme. In this paper, we argue in favor of carrying out these two phases of design concurrently. In order to do this efficiently, we need to be able to incrementally analyze the acyclicity status of a database scheme as it is being designed. To this end, we propose the formalism of "binary decompositions". Using this, we characterize design sequences that exactly generate theta-acyclic schemes, for theta = agr,beta. We then show how our results can be put to use in database design. Finally, we also show that our formalism above can be effectively used as a proof tool in dependency theory. We demonstrate its power by showing that it leads to a significant simplification of the proofs of some previous results connecting sets of multivalued dependencies and acyclic join dependencies.