Synthesis, DNA binding, docking and photocleavage studies of quinolinyl chalcones

A series of simple quinoline-chalcone conjugates have been synthesized by Claisen-Schmidt condensation reactions of substituted acetophenones with 2-chloro-3-formyl-quinoline and evaluated for their nucleolytic activity. The structures of the synthesized quinoline-chalcone conjugates were confirmed by IR, H-1 NMR, C-13 NMR and mass spectral analyses. Most of the prepared compounds showed significant DNA binding and photocleavage activities. The incorporation of an electron-donating group into ring A caused a moderate increase in the DNA binding and photocleavage activities. Compounds 3c and 3d exhibited promising DNA photocleavage against pUC 19 DNA with 85% inhibition at 100 mu M concentration. A structure-activity relationship analysis of these compounds was performed; compounds 3c and 3d are potential candidates for future drug discovery and development.

Synthesis, molecular docking and anti-mycobacterial evaluation of new imidazo1,2-a]pyridine-2-carboxamide derivatives

New anti-tubercular agents, imidazo1,2-a]pyridine-2-carboxamide derivatives (5a-q) have been designed and synthesized. The structural considerations of the designed molecules were further supported by the docking study with a long-chain enoyl-acyl carrier protein reductase (InhA). The chemical structures of the new compounds were characterized by IR, H-1 NMR, C-13 NMR, HRMS and elemental analysis. In addition, single crystal X-ray diffraction has also been recorded for compound 5f. Compounds were evaluated in vitro against Mycobacterium tuberculosis H37Rv, and cytotoxicity against HEK-293T cell line. Amongst the tested compounds 5j, 5l and 5q were emerged as good anti-tubercular agents with low cytotoxicity. The structure-anti TB activity relationship of these derivatives was explained by molecular docking. (C) 2014 Elsevier Masson SAS. All rights reserved.

Lower bounds on Ricci flow invariant curvatures and geometric applications

We consider Ricci flow invariant cones C in the space of curvature operators lying between the cones ``nonnegative Ricci curvature'' and ``nonnegative curvature operator''. Assuming some mild control on the scalar curvature of the Ricci flow, we show that if a solution to the Ricci flow has its curvature operator which satisfies R + epsilon I is an element of C at the initial time, then it satisfies R + epsilon I is an element of C on some time interval depending only on the scalar curvature control. This allows us to link Gromov-Hausdorff convergence and Ricci flow convergence when the limit is smooth and R + I is an element of C along the sequence of initial conditions. Another application is a stability result for manifolds whose curvature operator is almost in C. Finally, we study the case where C is contained in the cone of operators whose sectional curvature is nonnegative. This allows us to weaken the assumptions of the previously mentioned applications. In particular, we construct a Ricci flow for a class of (not too) singular Alexandrov spaces.

A note on D1-D5 entropy and geometric quantization

We quantize the space of 2-charge fuzzballs in IIB supergravity on K3. The resulting entropy precisely matches the D1-D5 black hole entropy, including a specific numerical coefficient. A partial match (ie., a smaller coefficient) was found by Rychkov a decade ago using the Lunin-Mathur subclass of solutions - we use a simple observation to generalize his approach to the full moduli space of K3 fuzzballs, filling a small gap in the literature.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

Synthesis, ABTS-Radical Scavenging Activity, and Antiproliferative and Molecular Docking Studies of Novel Pyrrolo1,2-a]quinoline Derivatives

A new 2,2-azinobis-(3-ethylbenzothiazoline-6-sulfonic acid) (ABTS)-radical scavenging and antiproliferative agents of pyrrolo1,2-a]quinoline derivatives have been synthesized. An efficient method for the synthesis of 14 novel diversified pyrrolo1,2-a]quinoline derivatives has been described using 4-(1,3-dioxolan-2-yl)quinoline and different phenacyl bromides in acetone and followed by reacting with different acetylenes in dimethylformamide/K2CO3. The structure of the newly synthesized compounds was determined by infrared, H-1 NMR, C-13 NMR, mass spectrometry, and elemental analysis. The in vitro antioxidant activity revealed that among all the tested compounds 5n exhibited maximum scavenging activity with ABTS. Compound 5b has showed good antiproliferative activity as an inhibitor of epidermal growth factor receptor (EGFR) tyrosine kinase.

Docking, molecular dynamics and QM/MM studies to delineate the mode of binding of CucurbitacinE to F-actin

CucurbitacinE (CurE) has been known to bind covalently to F-actin and inhibit depolymerization. However, the mode of binding of CurE to F-actin and the consequent changes in the F-actin dynamics have not been studied. Through quantum mechanical/molecular mechanical (QM/MM) and density function theory (DFT) simulations after the molecular dynamics (MD) simulations of the docked complex of F-actin and CurE, a detailed transition state (TS) model for the Michael reaction is proposed. The TS model shows nucleophilic attack of the sulphur of Cys257 at the beta-carbon of Michael Acceptor of CurE producing an enol intermediate that forms a covalent bond with CurE. The MD results show a clear difference between the structure of the F-actin in free form and F-actin complexed with CurE. CurE affects the conformation of the nucleotide binding pocket increasing the binding affinity between F-actin and ADP, which in turn could affect the nucleotide exchange. CurE binding also limits the correlated displacement of the relatively flexible domain 1 of F-actin causing the protein to retain a flat structure and to transform into a stable ``tense'' state. This structural transition could inhibit depolymerization of F-actin. In conclusion, CurE allosterically modulates ADP and stabilizes F-actin structure, thereby affecting nucleotide exchange and depolymerization of F-actin. (C) 2015 Elsevier Inc. All rights reserved.

Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.

Geometric optimization methods for the analysis of gene expression data

DNA microarrays provide such a huge amount of data that unsupervised methods are required to reduce the dimension of the data set and to extract meaningful biological information. This work shows that Independent Component Analysis (ICA) is a promising approach for the analysis of genome-wide transcriptomic data. The paper first presents an overview of the most popular algorithms to perform ICA. These algorithms are then applied on a microarray breast-cancer data set. Some issues about the application of ICA and the evaluation of biological relevance of the results are discussed. This study indicates that ICA significantly outperforms Principal Component Analysis (PCA).