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.

Theoretical-Studies On The Conformations Of Acyclic Alditols

The conformational analysis by energy calculation is described for some acyclic sugars such as D-glucitol, D-mannitol and galactitol. Planar Zig-zag conformation is the most favoured conformation for the three alditols. However, the energy difference between the ‘bent-chain’ and ‘straight-chain’ conformation is less in the case of D-glucitol (0.9 Kcal Mole-1)compared to those of D-mannitol (~2.4 Kcal mole-1)and galactitol (~2.5 Kcal Mole-1).The solvent accessibility studies favour bent –chain conformation for D-glucitol and straight-chain conformation for D-mannitol and glactitol. These conformations, arrived at by theorticle analysis are compared with those abseverd in the solid state determined by X=ray differaction techinique and their acetylated derivatives in solution by NMR technique. These studies suggest that, when the energy difference between straight and bent conformations is small, latticc energy (in the case of solids) and solvent (in the case of solutions) do play a dominant role on the favoured conformations.

Metabolism of structurally modified acyclic monoterpenes by Pseudomonas incognita

The ability of Pseudomonas incognita to metabolize some structurally modified acyclic monoterpenes was tested. The 6,7 double bond was found essential for these compounds to serve as a substrate for this organism, whereas the same was not true with the 1,2 double bond. Metabolism of dihydrolinalyl acetate by this strain yielded dihydrolinalool, dihydrolinalool-8-carboxylic acid, dihydrolinalyl acetate-8-carboxylic acid, and 4-acetoxy-4-methyl hexanoic acid. A cell-free extract prepared from dihydrolinalyl acetate grown cells transformed dihydrolinalyl acetate into dihydrolinalool and dihydrolinalool-8-carboxylic acid. Based on the identification of various metabolites isolated from the culture medium, and on growth and manometric studies carried out with the isolated metabolites as well as with related synthetic analogs, probable pathways for the biodegradation of dihydrolinalyl acetate are presented.

Microbial transformations of acyclic monoterpenes

Microbial degradation of geraniol, citronellol, linalool and their corresponding acetates, structurally modified linalool and linalyl acetate, α-terpineol and β-myrcene are presented. Oxygenative and prototropic rearrangements are normally observed during the microbial metabolism of monoterpenes. Three types of oxygenation reactions are observed, namely, (a) allylic oxygenation (b) oxygenation on a double bond and (c) addition of water across the double bond. The studies indicate commonality in the reaction types or processes occurring during the metabolism of various related monoterpenes and also establish the convergence of degradative pathways at a central catabolic intermediate.

Acyclic edge coloring of subcubic graphs

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 it is denoted by a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

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, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

Conformations of dehydrophenylalanine containing peptides: nmr studies of an acyclic hexapeptide with two delta Z-Phe residues

The conformation of an acyclic dehydrophenylalanine (delta Z-Phe) containing hexapeptide, Boc-Phe-delta Z-Phe-Val-Phe-delta Z-Phe-Val-OMe, has been investigated in CDCl3 and (CD3)2SO by 270-MHz 1H-nmr. Studies of NH group solvent accessibility and observation of interresidue nuclear Overhauser effects (NOEs) suggest a significant solvent-dependent conformational variability. In CDCl3, a population of folded helical conformations is supported by the inaccessibility to solvent of the NH groups of residues 3-6 and the detection of several NiH----Ni + 1H NOEs. Evidence is also obtained for conformational heterogeneity from the detection of some Ci alpha H----Ni + 1H NOEs characteristic of extended strands. In (CD3)2SO, the peptide largely favors an extended conformation, characterized by five solvent-exposed NH groups and successive Ci alpha H----Ni + 1H NOEs for the L-residues and Ci beta H----Ni + 1H NOEs for the delta Z-Phe residues. The results suggest that delta Z-Phe residues do not provide compelling conformational constraints.

Regiospecific hydroxylation of acyclic monoterpene alcohols by aspergillus_niger

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

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

Conformations of dehydrophenylalanyl containing peptides. Nuclear Overhauser effect study of two acyclic

Two isomeric, acyclic tetrapeptides containing a Z-dehydrophenylalanine residue (Δz-Phe) at position 2 or 3, Boc-Leu-Ala-Δz-Phe-Leu-OMe (1) and Boc-Leu-Δz-Phe-Ala-Leu-OMe (2), have been synthesized and their solution conformations investigated by 270MHz 1H n.m.r. spectroscopy. In peptide 1 the Leu(4) NH group appears to be partially shielded from solvent, while in peptide 2 both Ala(3) and Leu(4) NH groups show limited solvent accessibility. Extensive difference nuclear Overhauser effect (n.O.e.) studies establish the occurrence of several diagnostic inter-residue n.O.e.s (CαjH ⇆ Ni+1H and NiH ⇆ Ni+1H) between backbone protons. The simultaneous observation of “mutually exclusive” n.O.e.s suggests the presence of multiple solution conformations for both peptides. In peptide 1 the n.O.e. data are consistent with a dynamic equilibrium between an -Ala-Δz-Phe- Type II β-turn structure and a second species with Δz-Phe adopting a partially extended conformation with Ψ values of ± 100° to ± 150°. In peptide 2 the results are compatible with an equilibrium between a highly folded consecutive β-turn structure for the -Leu-Δz-Phe-Ala- segment and an almost completely extended conformation.

Utility of microbes in organic-synthesis - selective transformations of acyclic isoprenoids by aspergillus-niger

Bioconversion of acyclic isoprenoids using a strain of Aspergillus niger results in hydroxylated metabolites with regio- and stereoselectivity. The organism carries out oxidation of the terminal allylic methyl group and the remote double bond in all the compounds tested (I-VII). However, these two activities seem to have preferential structural requirements. When an acyclic isoprenoid with a ketone functionality such as geranylacetone is used as the substrate, the organism also carries out the asymmetric reduction of the keto group. All the metabolites formed have been purified and characterized by conventional spectroscopic methods and quantification has been made by gas chromatographic analyses.

Acyclic Edge-Coloring of Planar Graphs

A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].

On network coding for acyclic networks with delays

Problems related to network coding for acyclic, instantaneous networks (where the edges of the acyclic graph representing the network are assumed to have zero-delay) have been extensively dealt with in the recent past. The most prominent of these problems include (a) the existence of network codes that achieve maximum rate of transmission, (b) efficient network code constructions, and (c) field size issues. In practice, however, networks have transmission delays. In network coding theory, such networks with transmission delays are generally abstracted by assuming that their edges have integer delays. Using enough memory at the nodes of an acyclic network with integer delays can effectively simulate instantaneous behavior, which is probably why only acyclic instantaneous networks have been primarily focused on thus far. However, nulling the effect of the network delays are not always uniformly advantageous, as we will show in this work. Essentially, we elaborate on issues ((a), (b) and (c) above) related to network coding for acyclic networks with integer delays, and show that using the delay network as is (without adding memory) turns out to be advantageous, disadvantageous or immaterial, depending on the topology of the network and the problem considered i.e., (a), (b) or (c).