Search results for "combinatorial"

Synthesis of Fluorinated and Nonfluorinated Tebufenpyrad Analogues for the Study of Anti-angiogenesis MOA

2014

In this contribution we report the synthesis of fluorinated and nonfluorinated tebufenpyrad analogues to explore potential druglike properties through the phenotypic screening as part of the Lilly Open Innovation Drug Discovery (OIDD) program.

ChemInform Abstract: Total Syntheses and Synthetic Studies of Spongiane Diterpenes

2008

Synthesis of β-methylfurolabdanes from (+)-sclareolide

2002

An efficient synthesis of the methylfurolabdane 3 from (+)-sclareolide (6) via the hydroxyalkenes 12 is reported. Alternative modes of cyclization of 12 allowed the synthesis of methyldihydrofuran derivatives 4 and 5 and methyltetrahydrofuran derivatives 15. (© Wiley-VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2002)

New route to herbertanes via a Suzuki cross-coupling reaction: synthesis of herbertenediol

2001

Abstract The synthesis of herbertenediol, a relevant member of the herbertane-type sesquiterpene family, is described. The synthesis is based on a new general approach to this group of sesquiterpenes where the herbertane skeleton is constructed using a Suzuki cross-coupling reaction and a [2,3]-sigmatropic Still–Wittig rearrangement as key synthetic steps.

The Di-Tert-Butyl Oxymethylphosphonate Route to the Antiviral Drug Tenofovir

2020

<div>The present manuscript describes a simple, two step synthesis of tenofovir from HPA through phosphonomethalation with a novel doubly protected oxymethylphosphonate electrophile. The crystalline electrophile can be prepared in a simple reaction sequence and can be deblocked more easily than its ditehyl analogue involved in the current commercial process for making the drug.</div><div>The approach is general and can also be used for the preparation of related antivirals and the synthesis of adefovir is described as well.<br></div>

ChemInform Abstract: Synthesis and Isolation of Enantiomerically Enriched Cyclopenta[b]benzofurans Based on Products from Anodic Oxidation of 2,4-Dim…

2015

Tetramer (I) is obtained by anodic oxidation of 2,4-dimethylphenol as reported in a previous paper.

ChemInform Abstract: ortho-Functionalized Aryltetrazines by Direct Palladium-Catalyzed C-H Halogenation: Application to Fast Electrophilic Fluorinati…

2016

A general catalyzed direct C-H functionalization of s-tetrazines is reported. Under mild reaction conditions, N-directed ortho-C-H activation of tetrazines allows the introduction of various functional groups, thus forming carbon-heteroatom bonds: C-X (X=I, Br, Cl) and C-O. Based on this methodology, we developed electrophilic mono- and poly-ortho-fluorination of tetrazines. Microwave irradiation was optimized to afford fluorinated s-aryltetrazines, with satisfactory selectivity, within only ten minutes. This work provides an efficient and practical entry for further accessing highly substituted tetrazine derivatives (iodo, bromo, chloro, fluoro, and acetate precursors). It gives access to …

A Regio- and Diastereoselective Anodic Aryl-Aryl Coupling in the Biomimetic Total Synthesis of (-)-Thebaine.

2018

The biosynthesis of thebaine is based on the regioselective, intramolecular, oxidative coupling of (R)-reticuline. For decades, chemists have sought to mimic this coupling by using stoichiometric oxidants. However, all approaches to date have suffered from low yields or the formation of undesired regioisomers. Electrochemistry would represent a sustainable alternative in this respect but all attempts to accomplish an electrochemical synthesis of thebaine have failed so far. Herein, a regio- and diastereoselective anodic coupling of 3',4',5'-trioxygenated laudanosine derivatives is presented, which finally enables electrochemical access to (-)-thebaine.

Combining finite learning automata with GSAT for the satisfiability problem

2010

A large number of problems that occur in knowledge-representation, learning, very large scale integration technology (VLSI-design), and other areas of artificial intelligence, are essentially satisfiability problems. The satisfiability problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True. The growing need for more efficient and scalable algorithms has led to the development of a large number of SAT solvers. This paper reports the first approach that combines finite learning automata with the greedy satisfiability algorithm (GSAT). In brief, we introduce a new algorithm that integrates finite learning automata and traditional GSAT use…

Solving Graph Coloring Problems Using Learning Automata

2008

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem with numerous applications, including time tabling, frequency assignment, and register allocation. The growing need for more efficient algorithms has led to the development of several GCP solvers. In this paper, we introduce the first GCP solver that is based on Learning Automata (LA). We enhance traditional Random Walk with LA-based learning capability, encoding the GCP as a Boolean satisfiability problem (SAT). Extensive experiments demonstrate that the LA significantly improve the performance of RW, thus laying the foundation for novel LA-based solutions to the GCP.