No abstract

The plasmid-based replacement of the multifunctional protein subunits of the pikromycin PKS in S. venezuelae by the corresponding subunits from heterologous modular PKSs resulted in recombinant strains that produce both 12- and 14-membered ring macrolactones with predicted structural alterations. In all cases, novel macrolactones were produced and further modified by the DesVII glycosyltransferase and PikC hydroxylase, leading to biologically active macrolide structures. These results demonstrate that hybrid PKSs in S. venezuelae can produce a multiplicity of new macrolactones that are modified further by the highly flexible DesVII glycosyltransferase and PikC hydroxylase tailoring enzymes. This work demonstrates the unique capacity of the S. venezuelae pikromycin pathway to expand the toolbox of combinatorial biosynthesis and to accelerate the creation of novel biologically active natural products.

A flexible and convenient approach was developed for the synthesis of 10-deoxymethynolide (1) and narbonolide (2), which are aglycones of the methymycin and the pikromycin families of macrolide antibiotics. These lactones are produced by pikromycin polyketide synthase from Streptomyces venezuelae. Polyketide lactones, 10-deoxymethynolide and narbonolide, which contain 12- and 14-membered rings, respectively, were synthesized efficiently. These target lactones were retrosynthetically divided into three parts and assembled by using an asymmetric aldol reaction, the Yamaguchi esterification, and ring-closing metathesis. The ring-closing metathesis reaction catalyzed by the second-generation Grubbs catalyst is particularly efficient in preparing these macrocyclic polyketide lactones.

1This paper describes a SAT-based unbounded symbolic model checking algorithm. BDDs have been widely used for symbolic model checking, but the approach suffers from memory overflow. The SAT procedure was exploited to overcome the problem, but it verified only the states reachable through a bounded number of transitions. The proposed algorithm deals with unbounded symbolic model checking. The conjunctive normal form is used to represent sets of states and the transition relation, and a SAT procedure is modified to compute the existential quantification required in obtaining a pre-image. Some optimization techniques are exploited, and the depth first search method is used for efficient safety-property checking. Experimental results show the proposed algorithm can check more circuits than BDD-based symbolic model checking tools.