Scalable De Novo Synthesis of Aldgarose and Total Synthesis of Aldgamycin N

Since the accompanying study had shown that the introduction of the eponymous aldgarose sugar to the C5‐OH group of the macrocyclic aglycone of aldgamycin N is most difficult, if not even impossible, the synthesis route was revised and the glycosidation performed at an earlier stage. To mitigate the “cost” of this strategic amendment, a practical and scalable de novo synthesis of this branched octose was developed. The glycoside formation required mild conditions; it commenced with the reaction of the aglycone with the trichloroacetimidate donor to give a transient orthoester, which slowly rearranged to the desired aldgaropyranoside. The presence of the polar peripheral groups in the product did not impede the selective late‐stage functionalization of the macrolide ring itself: the contained propargylic alcohol entity was readily transformed into the characteristic acyloin motif of the target by a ruthenium‐catalyzed trans‐hydrostannation followed by a modified Chan‐Lam‐type coupling

Total Synthesis of Mycinamicin IV as Integral Part of a Collective Approach to Macrolide Antibiotics

The total synthesis of the 16-membered macrolide mycinamicin IV is outlined, which complements our previously disclosed, largely catalysis-based route to the aglycone. This work must also be seen in the context of our recent conquest of aldgamycin N, a related antibiotic featuring a similar core but a distinctly different functionalization pattern. Taken together, these projects prove that the underlying blueprint is integrative and hence qualifies for a collective approach to this prominent class of natural products. In both cases, the final glycosylation phase mandated close attention and was accomplished only after robust de novo syntheses of the (di)deoxy sugars of the desosamine, chalcose, mycinose and aldgarose types had been established. Systematic screening of the glycosidation promoter was also critically important for success

On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed, and minimum zone circle or sphere

Sequential linear programming methods have been successfully used to solve some sphere and circle problems. Indeed, empirical evidence shows that these frequently find the required solutions in one step. An analysis is presented here which attempts to give an explanation of this phenomemon

One-step behaviour of a method for finding a maximal solution of a system of linear inequalities

It has been observed empirically that a simple linearization method applied to the problem of finding maximal solutions to systems of linear inequalities frequently terminates in one step. This is normally a Kuhn-Tucker point, and depending on the starting point, can be a global solution. An explanation of this phenomenon is given, and this is illustrated by examples

Total Synthesis of the Tetracyclic Pyridinium Alkaloid epi-Tetradehydrohalicyclamine B

The first total synthesis of a tetracyclic marine pyridinium alkaloid hinged on recent advances in chemoselectivity management: While many classical methods failed to afford the perceptively simple pyridine-containing core of the target, nickel/iridium photoredox dual catalysis allowed the critical C−C-bond to be formed in good yield. Likewise, ring closing alkyne metathesis (RCAM) worked well in the presence of the unhindered pyridine despite the innately Lewis acidic Mo(+6) center of the alkylidyne catalyst. Finally, an iridium catalyzed hydrosilylation was uniquely effective in reducing a tertiary amide without compromising an adjacent pyridine and the lateral double bonds; this transformation is largely without precedent. The second strained macrocycle enveloping the core was closed by intramolecular N-alkylation with formation of the pyridinium unit; the reaction proceeded site- and chemoselectively in the presence of an a priori more basic tertiary amine

Total Synthesis of Mycinolide IV and Path‐Scouting for Aldgamycin N

Proof‐of‐concept is provided that a large estate of 16‐membered macrolide antibiotics can be reached by a “unified” approach. The key building block was formed on scale by an asymmetric vinylogous Mukaiyama aldol reaction; its alkene terminus was then converted either into the corresponding methyl ketone by Wacker oxidation or into a chain‐extended aldehyde by catalyst‐controlled branch‐selective asymmetric hydroformylation. These transformations ultimately opened access to two structurally distinct series of macrolide targets. Notable late‐stage maneuvers comprise a rare example of a ruthenium‐catalyzed redox isomerization of an 1,3‐enyne‐5‐ol into a 1,3‐diene‐5‐one derivative, as well as the elaboration of a tertiary propargylic alcohol into an acyloin by trans‐hydrostannation/Chan‐Lam‐type coupling. Moreover, this case study illustrates the underutilized possibility of forging complex macrolactone rings by transesterification under essentially neutral conditions

lp-Recovery of the Most Significant Subspace among Multiple Subspaces with Outliers

We assume data sampled from a mixture of d-dimensional linear subspaces with spherically symmetric distributions within each subspace and an additional outlier component with spherically symmetric distribution within the ambient space (for simplicity we may assume that all distributions are uniform on their corresponding unit spheres). We also assume mixture weights for the different components. We say that one of the underlying subspaces of the model is most significant if its mixture weight is higher than the sum of the mixture weights of all other subspaces. We study the recovery of the most significant subspace by minimizing the lp-averaged distances of data points from d-dimensional subspaces, where p>0. Unlike other lp minimization problems, this minimization is non-convex for all p>0 and thus requires different methods for its analysis. We show that if 0<p<=1, then for any fraction of outliers the most significant subspace can be recovered by lp minimization with overwhelming probability (which depends on the generating distribution and its parameters). We show that when adding small noise around the underlying subspaces the most significant subspace can be nearly recovered by lp minimization for any 0<p<=1 with an error proportional to the noise level. On the other hand, if p>1 and there is more than one underlying subspace, then with overwhelming probability the most significant subspace cannot be recovered or nearly recovered. This last result does not require spherically symmetric outliers.Comment: This is a revised version of the part of 1002.1994 that deals with single subspace recovery. V3: Improved estimates (in particular for Lemma 3.1 and for estimates relying on it), asymptotic dependence of probabilities and constants on D and d and further clarifications; for simplicity it assumes uniform distributions on spheres. V4: minor revision for the published versio

Long-term follow-up of high-dose chemotherapy with autologous stem-cell transplantation and response-adapted whole-brain radiotherapy for newly diagnosed primary CNS lymphoma: results of the multicenter Ostdeutsche Studiengruppe Hämatologie und Onkologie OSHO-53 phase II study

Background We previously reported the results of a phase II study for patients with newly diagnosed primary central nervous system lymphoma treated with autologous peripheral blood stem-cell transplantation (aPBSCT) and response-adapted whole-brain radiotherapy (WBRT). Now, we update the initial results. Patients and methods From 1999 to 2004, 23 patients received high-dose methotrexate. In case of at least partial remission, high-dose busulfan/thiotepa (HD-BuTT) followed by aPBSCT was carried out. Patients refractory to induction or without complete remission after HD-BuTT received WBRT. Eight patients still alive in 2011 were contacted and Mini-Mental State Examination (MMSE) and the European Organisation for Research and Treatment of Cancer quality-of-life questionnaire (QLQ)-C30 were carried out. Results Of eight patients still alive, median follow-up is 116.9 months. Only one of nine irradiated patients is still alive with a severe neurologic deficit. In seven of eight patients treated with HD-BuTT, health condition and quality of life are excellent. MMSE and QLQ-C30 showed remarkably good results in patients who did not receive WBRT. All of them have a Karnofsky score of 90%-100%. Conclusions Follow-up shows an overall survival of 35%. In six of seven patients where WBRT could be avoided, no long-term neurotoxicity has been observed and all patients have an excellent quality of lif

A simulated annealing methodology for clusterwise linear regression

In many regression applications, users are often faced with difficulties due to nonlinear relationships, heterogeneous subjects, or time series which are best represented by splines. In such applications, two or more regression functions are often necessary to best summarize the underlying structure of the data. Unfortunately, in most cases, it is not known a priori which subset of observations should be approximated with which specific regression function. This paper presents a methodology which simultaneously clusters observations into a preset number of groups and estimates the corresponding regression functions' coefficients, all to optimize a common objective function. We describe the problem and discuss related procedures. A new simulated annealing-based methodology is described as well as program options to accommodate overlapping or nonoverlapping clustering, replications per subject, univariate or multivariate dependent variables, and constraints imposed on cluster membership. Extensive Monte Carlo analyses are reported which investigate the overall performance of the methodology. A consumer psychology application is provided concerning a conjoint analysis investigation of consumer satisfaction determinants. Finally, other applications and extensions of the methodology are discussed.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45745/1/11336_2005_Article_BF02296405.pd