Epigallocatechin gallate is a slow-tight binding inhibitor of enoyl-ACP reductase from Plasmodium falciparum

Epigallocatechin gallate (EGCG) is known to have numerous pharmacological properties. In the present study, we have shown that EGCG inhibits enoyl–acyl carrier protein reductase of Plasmodium falciparum (PfENR) by following a two-step, slow, tight-binding inhibition mechanism. The association/isomerization rate constant (k5) of the reversible and loose PfENR–EGCG binary complex to a tight [PfENR–EGCG]* or EI* complex was calculated to be 4.0 × 10−2 s−1. The low dissociation rate constant (k6) of the [PfENR–EGCG]* complex confirms the tight-binding nature of EGCG. EGCG inhibited PfENR with the overall inhibition constant (Ki*) of 7.0 ± 0.8 nM. Further, we also studied the effect of triclosan on the inhibitory activity of EGCG. Triclosan lowered the k6 of the EI* complex by 100 times, lowering the overall Ki* of EGCG to 97.5 ± 12.5 pM. The results support EGCG as a promising candidate for the development of tea catechin based antimalarial drugs.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

Angelica archengelica extract induced perturbation of rat skin and tight junctional protein (ZO-1) of HaCaT cells

Background and purpose of the study: Herbal enhancers compared to the synthetic ones have shown less toxis effects. Coumarins have been shown at concentrations inhibiting phospoliphase C-Y (Phc-Y) are able to enhance tight junction (TJ) permeability due to hyperpoalation of Zonolous Occludense-1 (ZO-1) proteins. The purpose of this study was to evaluate the influence of ethanolic extract of Angelica archengelica (AA-E) which contain coumarin on permeation of repaglinide across rat epidermis and on the tight junction plaque protein ZO-1 in HaCaT cells. Methods: Transepidermal water loss (TEWL) from the rat skin treated with different concentrations of AA-E was assessed by Tewameter. Scanning and Transmission Electron Microscopy (TEM) on were performed on AA-E treated rat skin portions. The possibility of AA-E influence on the architecture of tight junctions by adverse effect on the cytoplasmic ZO-1 in HaCaT cells was investigated. Finally, the systemic delivery of repaglinide from the optimized transdermal formulation was investigated in rats. Results: The permeation of repaglinide across excised rat epidermis was 7-fold higher in the presence of AA-E (5% w/v) as compared to propylene glycol:ethanol (7:3) mixture. The extract was found to perturb the lipid microconstituents in both excised and viable rat skin, although, the effect was less intense in the later. The enhanced permeation of repaglinide across rat epidermis excised after treatment with AA-E (5% w/v) for different periods was in concordance with the high TEWL values of similarly treated viable rat skin. Further, the observed increase in intercellular space, disordering of lipid structure and corneocyte detachment indicated considerable effect on the ultrastructure of rat epidermis. Treatment of HaCaT cell line with AA-E (0.16% w/v) for 6 hrs influenced ZO-1 as evidenced by reduced immunofluorescence of anti-TJP1 (ZO-1) antibody in Confocal Laser Scanning Microscopy studies (CLSM) studies. The plasma concentration of repaglinide from transdermal formulation was maintained higher and for longer time as compared to oral administration of repaglinide. Major conclusion: Results suggest the overwhelming influence of Angelica archengelica in enhancing the percutaneous permeation of repaglinide to be mediated through perturbation of skin lipids and tight junction protein (ZO-1).

Tight co-degree condition for perfect matchings in 4-graphs

We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

An infinite family of tight triangulations of manifolds

We give explicit construction of vertex-transitive tight triangulations of d-manifolds for d >= 2. More explicitly, for each d >= 2, we construct two (d(2) + 5d + 5)-vertex neighborly triangulated d-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated manifolds currently known is the series of non-simply connected triangulated d-manifolds with 2d + 3 vertices constructed by Kuhnel. The manifolds we construct are strongly minimal. For d >= 3, they are also tight neighborly as defined by Lutz, Sulanke and Swartz. Like Kuhnel complexes, our manifolds are orientable in even dimensions and non-orientable in odd dimensions. (c) 2013 Elsevier Inc. All rights reserved.

Non-existence of tight neighborly triangulated manifolds with beta(1)=2

All triangulated d-manifolds satisfy the inequality ((f0-d-1)(2)) >= ((d+2)(2))beta(1) for d >= 3. A triangulated d-manifold is called tight neighborly if it attains equality in this bound. For each d >= 3, a (2d + 3)-vertex tight neighborly triangulation of the Sd-1-bundle over S-1 with beta(1) = 1 was constructed by Kuhnel in 1986. In this paper, it is shown that there does not exist a tight neighborly triangulated manifold with beta(1) = 2. In other words, there is no tight neighborly triangulation of (Sd-1 x S-1)(#2) or (Sd-1 (sic) S-1)(#2) for d >= 3. A short proof of the uniqueness of K hnel's complexes for d >= 4 under the assumption beta(1) not equal 0 is also presented.

A provably tight delay-driven concurrently congestion mitigating global routing algorithm

Routing is a very important step in VLSI physical design. A set of nets are routed under delay and resource constraints in multi-net global routing. In this paper a delay-driven congestion-aware global routing algorithm is developed, which is a heuristic based method to solve a multi-objective NP-hard optimization problem. The proposed delay-driven Steiner tree construction method is of O(n(2) log n) complexity, where n is the number of terminal points and it provides n-approximation solution of the critical time minimization problem for a certain class of grid graphs. The existing timing-driven method (Hu and Sapatnekar, 2002) has a complexity O(n(4)) and is implemented on nets with small number of sinks. Next we propose a FPTAS Gradient algorithm for minimizing the total overflow. This is a concurrent approach considering all the nets simultaneously contrary to the existing approaches of sequential rip-up and reroute. The algorithms are implemented on ISPD98 derived benchmarks and the drastic reduction of overflow is observed. (C) 2014 Elsevier Inc. All rights reserved.

1D Tight-Binding Models Render Quantum First Passage Time ``Speakable''

The calculation of First Passage Time (moreover, even its probability density in time) has so far been generally viewed as an ill-posed problem in the domain of quantum mechanics. The reasons can be summarily seen in the fact that the quantum probabilities in general do not satisfy the Kolmogorov sum rule: the probabilities for entering and non-entering of Feynman paths into a given region of space-time do not in general add up to unity, much owing to the interference of alternative paths. In the present work, it is pointed out that a special case exists (within quantum framework), in which, by design, there exists one and only one available path (i.e., door-way) to mediate the (first) passage -no alternative path to interfere with. Further, it is identified that a popular family of quantum systems - namely the 1d tight binding Hamiltonian systems - falls under this special category. For these model quantum systems, the first passage time distributions are obtained analytically by suitably applying a method originally devised for classical (stochastic) mechanics (by Schroedinger in 1915). This result is interesting especially given the fact that the tight binding models are extensively used in describing everyday phenomena in condense matter physics.

Tight triangulations of closed 3-manifolds

A triangulation of a closed 2-manifold is tight with respect to a field of characteristic two if and only if it is neighbourly; and it is tight with respect to a field of odd characteristic if and only if it is neighbourly and orientable. No such characterization of tightness was previously known for higher dimensional manifolds. In this paper, we prove that a triangulation of a closed 3-manifold is tight with respect to a field of odd characteristic if and only if it is neighbourly, orientable and stacked. In consequence, the Kuhnel-Lutz conjecture is valid in dimension three for fields of odd characteristic. Next let F be a field of characteristic two. It is known that, in this case, any neighbourly and stacked triangulation of a closed 3-manifold is F-tight. For closed, triangulated 3-manifolds with at most 71 vertices or with first Betti number at most 188, we show that the converse is true. But the possibility of the existence of an F-tight, non-stacked triangulation on a larger number of vertices remains open. We prove the following upper bound theorem on such triangulations. If an F-tight triangulation of a closed 3-manifold has n vertices and first Betti number beta(1), then (n - 4) (617n - 3861) <= 15444 beta(1). Equality holds here if and only if all the vertex links of the triangulation are connected sums of boundary complexes of icosahedra. (C) 2015 Elsevier Ltd. All rights reserved.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.

Cubicity, boxicity, and vertex cover

A k-dimensional box is the cartesian product R-1 x R-2 x ... x R-k where each R-i is a closed interval on the real line. The boxicity of a graph G,denoted as box(G), is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the cartesian product R-1 x R-2 x ... x R-k where each Ri is a closed interval on the real line of the form [a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. In this paper we show that cub(G) <= t + inverted right perpendicularlog(n - t)inverted left perpendicular - 1 and box(G) <= left perpendiculart/2right perpendicular + 1, where t is the cardinality of a minimum vertex cover of G and n is the number of vertices of G. We also show the tightness of these upper bounds. F.S. Roberts in his pioneering paper on boxicity and cubicity had shown that for a graph G, box(G) <= left perpendicularn/2right perpendicular and cub(G) <= inverted right perpendicular2n/3inverted left perpendicular, where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then box(G) <= inverted right perpendicularn/4inverted left perpendicular and this bound is tight. We also show that if G is a bipartite graph then cub(G) <= n/2 + inverted right perpendicularlog n inverted left perpendicular - 1. We point out that there exist graphs of very high boxicity but with very low chromatic number. For example there exist bipartite (i.e., 2 colorable) graphs with boxicity equal to n/4. Interestingly, if boxicity is very close to n/2, then chromatic number also has to be very high. In particular, we show that if box(G) = n/2 - s, s >= 0, then chi (G) >= n/2s+2, where chi (G) is the chromatic number of G.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

Retrogressed eclogite (20 kbar, 1020 °C) from the Neoproterozoic Palghat–Cauvery suture zone, southern India

The Palghat–Cauvery suture zone in southern India separates Archaean crustal blocks to the north and the Proterozoic Madurai block to the south. Here we present the first detailed study of a partially retrogressed eclogite (from within the Sittampundi anorthositic complex in the suture zone) that occurs as a 20-cm wide layer in a garnet gabbro layer in anorthosite. The eclogite largely consists of an assemblage of coexisting porphyroblasts of almandine–pyrope garnet and augitic clinopyroxene. However, a few garnets contain inclusions of omphacite. Rims and symplectites composed of Na–Ca amphibole and plagioclase form a retrograde assemblage. Petrographic analysis and calculated phase equilibria indicate that garnet–omphacite–rutile–melt was the peak metamorphic assemblage and that it formed at ca. 20 kbar and above 1000 °C. The eclogite was exhumed on a very tight hairpin-type, anticlockwise P–T path, which we relate to subduction and exhumation in the Palghat–Cauvery suture zone. The REE composition of the minerals suggests a basaltic oceanic crustal protolith metamorphosed in a subduction regime. Geological–structural relations combined with geophysical data from the Palghat–Cauvery suture zone suggest that the eclogite facies metamorphism was related to formation of the suture zone. Closure of the Mozambique Ocean led to development of the suture zone and to its western extension in the Betsimisaraka suture of Madagascar.

Effect of Structural Modification on the Quantum-Size Effect in II-VI Semiconducting Nanocrystals

The electronic structure of group II-VI semiconductors in the stable wurtzite form is analyzed using state-of-the-art ab initio approaches to extract a simple and chemically transparent tight-binding model. This model can be used to understand the variation in the bandgap with size, for nanoclusters of these compounds. Results complement similar information already available for same systems in the zinc blende structure. A comparison with all available experimental data on quantum size effects in group II-VI semiconductor nanoclusters establishes a remarkable agreement between theory and experiment in both structure types, thereby verifying the predictive ability of our approach. The significant dependence of the quantum size effect on the structure type suggests that the experimental bandgap change at a given size compared to the bulk bandgap, may be used to indicate the structural form of the nanoclusters, particularly in the small size limit, where broadening of diffraction features often make it difficult to unambiguously determine the structure.

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts

A cut (A, B) (where B = V - A) in a graph G = (V, E) is called internal if and only if there exists a vertex x in A that is not adjacent to any vertex in B and there exists a vertex y is an element of B such that it is not adjacent to any vertex in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A, B) in a chordal graph G, there exists a clique with kappa(G) + vertices (where kappa(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A, B). In fact we give a stronger result: For any internal cut (A, B) of a chordal graph, and for each i, 0 <= i <= kappa(G) + 1 such that vertical bar K-i vertical bar = kappa(G) + 1, vertical bar A boolean AND K-i vertical bar = i and vertical bar B boolean AND K-i vertical bar = kappa(G) + 1 - i. An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Omega(k(2)), where kappa(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least kappa(G)(kappa(G)+1)/2 where kappa(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to kappa(G). This result is tight.