Heat shock protein 70 on Neuro2a cells is a putative receptor for Japanese encephalitis virus

Japanese encephalitis virus (JEV) envelope (E) protein has been shown to play a critical role in attachment to cells. However, the receptor interacting with envelope protein has not been conclusively identified. Using mouse neuroblastoma (Neuro2a) cells and purified JEV-E protein in `Virus Overlay Protein Binding Assay' followed by MALDI-TOF analysis, we identified `heat shock protein 70' (Hsp70) as a possible receptor for JEV. Indirect immunofluorescence and flow-cytometry analysis demonstrated localization of Hsp70 on Neuro2a cell surface. Co-immunoprecipitation followed by Western blot analysis reconfirmed the interaction between Hsp70 and JEV-E protein. Further, anti-Hsp70 polyclonal-antibodies were able to block JEV entry into Neuro2a cells. Additionally, using the bioinformatic tool - FTDOCK, clocking between the proteins was performed. Amongst six interacting structural poses studied one pose involving RGD motif on JEV-E and leucine(539) on Hsp70 displayed stable interaction. These observations indicate that Hsp70 serves as putative receptor for JEV in Neuro2A cells.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), 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. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

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.

Miniversal Deformations Of Dialgebras

We develop the theory of versal deformations of dialgebras and describe a method for constructing a miniversal deformation of a dialgebra.

Cohomology with coefficients for operadic coalgebras

Corepresentations of a coalgebra over a quadratic operad are defined, and various characterizations of them are given. Cohomology of such an operadic coalgebra with coefficients in a corepresentation is then studied.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Kinetics and the Mechanism of Interaction of the Endoplasmic Reticulum Chaperone, Calreticulin, with Monoglucosylated (Glc1Man9GlcNAc2) Substrate

Calreticulin is a lectin-like molecular chaperone of the endoplasmic reticulum in eukaryotes. Its interaction with N-glycosylated polypeptides is mediated by the glycan, Glc(1)Man(9)GlcNAc(2), present on the target glycoproteins. In this work, binding of monoglucosyl IgG (chicken) substrate to calreticulin has been studied using real time association kinetics of the interaction with the biosensor based on surface plasmon resonance (SPR). By SPR, accurate association and dissociation rate constants were determined, and these yielded a micromolar association constant. The nature of reaction was unaffected by immobilization of either of the reactants. The Scatchard analysis values for K-a agreed web crith the one obtained by the ratio k(1)/k(-1). The interaction was completely inhibited by free oligosaccharide, Glc(1)Man(9)GlcNAc(2), whereas Man(9)GlcNAc(2) did not bind to the calreticulin-substrate complex, attesting to the exquisite specificity of this interaction. The binding of calreticulin to IgG was used for the development of immunoassay and the relative affinity of the lectin-substrate association was indirectly measured. The values are in agreement with those obtained with SPR. Although the reactions are several orders of magnitude slower than the diffusion controlled processes, the data are qualitatively and quantitatively consistent with single-step bimolecular association and dissociation reaction. Analyses of the activation parameters indicate that reaction is enthalpically driven and does not involve a highly ordered transition state. Based on these data, the mechanism of its chaperone activity is briefly discussed.

Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms

A spanning tree T of a graph G is said to be a tree t-spanner if the distance between any two vertices in T is at most t times their distance in G. A graph that has a tree t-spanner is called a tree t-spanner admissible graph. The problem of deciding whether a graph is tree t-spanner admissible is NP-complete for any fixed t >= 4 and is linearly solvable for t <= 2. The case t = 3 still remains open. A chordal graph is called a 2-sep chordal graph if all of its minimal a - b vertex separators for every pair of non-adjacent vertices a and b are of size two. It is known that not all 2-sep chordal graphs admit tree 3-spanners This paper presents a structural characterization and a linear time recognition algorithm of tree 3-spanner admissible 2-sep chordal graphs. Finally, a linear time algorithm to construct a tree 3-spanner of a tree 3-spanner admissible 2-sep chordal graph is proposed. (C) 2010 Elsevier B.V. All rights reserved.

Non-contractible non-edges in 2-connected graphs

Any pair of non-adjacent vertices forms a non-edge in a graph. Contraction of a non-edge merges two non-adjacent vertices into a single vertex such that the edges incident on the non-adjacent vertices are now incident on the merged vertex. In this paper, we consider simple connected graphs, hence parallel edges are removed after contraction. The minimum number of nodes whose removal disconnects the graph is the connectivity of the graph. We say a graph is k-connected, if its connectivity is k. A non-edge in a k-connected graph is contractible if its contraction does not result in a graph of lower connectivity. Otherwise the non-edge is non-contractible. We focus our study on non-contractible non-edges in 2-connected graphs. We show that cycles are the only 2-connected graphs in which every non-edge is non-contractible. (C) 2010 Elsevier B.V. All rights reserved.

Permanent Genetic Resources added to Molecular Ecology Resources Database 1 August 2010-30 September 2010

This article documents the addition of 229 microsatellite marker loci to the Molecular Ecology Resources Database. Loci were developed for the following species: Acacia auriculiformis x Acacia mangium hybrid, Alabama argillacea, Anoplopoma fimbria, Aplochiton zebra, Brevicoryne brassicae, Bruguiera gymnorhiza, Bucorvus leadbeateri, Delphacodes detecta, Tumidagena minuta, Dictyostelium giganteum, Echinogammarus berilloni, Epimedium sagittatum, Fraxinus excelsior, Labeo chrysophekadion, Oncorhynchus clarki lewisi, Paratrechina longicornis, Phaeocystis antarctica, Pinus roxburghii and Potamilus capax. These loci were cross-tested on the following species: Acacia peregrinalis, Acacia crassicarpa, Bruguiera cylindrica, Delphacodes detecta, Tumidagena minuta, Dictyostelium macrocephalum, Dictyostelium discoideum, Dictyostelium purpureum, Dictyostelium mucoroides, Dictyostelium rosarium, Polysphondylium pallidum, Epimedium brevicornum, Epimedium koreanum, Epimedium pubescens, Epimedium wushanese and Fraxinus angustifolia.

Dendritic Poly(ether imine) Based Gene Delivery Vector

The nonviral vector based gene delivery approach is attractive due to advantages associated with molecular-level modifications suitable for optimization of vector properties. In a new class of nonviral gene delivery systems, we herein report the potential of poly(ether Mine) (PETIM) dendrimers to mediate an effective gene delivery function. PETIM dendrimer, constituted with tertiary amine branch points, n-propyl ether linkers and primary amines at their peripheries, exhibits significantly reduced toxicities, over a broad concentration range. The dendrimer complexes pDNA effectively, protects DNA from endosomal damages, and delivers to the cell nucleus. Gene transfection studies, utilizing a reporter plasmid pEGFP-C1 and upon complexation with dendrimer, showed a robust expression of the encoded protein. The study shows that PETIM dendrimers are hitherto unknown novel gene delivery vectors, combining features of poly(ethylene imine)-based polymers and dendrimers, yet are relatively nontoxic and structurally precise.

HLA-B*57 and Gender Influence the Occurrence of Tuberculosis in HIV Infected People of South India

Background. Substantial evidence exists for HLA and other host genetic factors being determinants of susceptibility or resistance to infectious diseases. However, very little information is available on the role of host genetic factors in HIV-TB coinfection. Hence, a longitudinal study was undertaken to investigate HLA associations in a cohort of HIV seropositive individuals with and without TB in Bangalore, South India. Methods. A cohort of 238 HIV seropositive subjects were typed for HLA-A, B, and DR by PCR-SSP and followed up for 5 years or till manifestation of Tuberculosis. HLA data of 682 HIV Negative healthy renal donors was used as control. Results. The ratio of males and females in HIV cohort was comparable (50.4% and 49.6%). But the incidence of TB was markedly lower in females (12.6%,) than males (25.6%). Further, HLA-B* 57 frequency in HIV cohort was significantly higher among females without TB (21.6%, 19/88) than males (1.7%, 1/59); P = 0.0046; OR = 38. CD4 counts also were higher among females in this cohort. Conclusion. This study suggests that HIV positive women with HLA-B* 57 have less occurrence of TB as compared to males.

Novel Pentameric Structure of the Diarrhea-Inducing Region of the Rotavirus Enterotoxigenic Protein NSP4

A novel pentameric structure which differs from the previously reported tetrameric form of the diarrhea-inducing region of the rotavirus enterotoxin NSP4 is reported here. A significant feature of this pentameric form is the absence of the calcium ion located in the core region of the tetrameric structures. The lysis of cells, the crystallization of the region spanning residues 95 to 146 of NSP4 (NSP4(95-146)) of strain ST3 (ST3: NSP4(95-146)) at acidic pH, and comparative studies of the recombinant purified peptide under different conditions by size-exclusion chromatography (SEC) and of the crystal structures suggested pH-, Ca(2+)-, and protein concentration-dependent oligomeric transitions in the peptide. Since the NSP4(95-146) mutant lacks the N-terminal amphipathic domain (AD) and most of the C-terminal flexible region (FR), to demonstrate that the pentameric transition is not a consequence of the lack of the N- and C-terminal regions, glutaraldehyde cross-linking of the Delta N72 and Delta N94 mutant proteins, which contain or lack the AD, respectively, but possess the complete C-terminal FR, was carried out. The results indicate the presence of pentamers in preparations of these longer mutants. Detailed SEC analyses of Delta N94 prepared under different conditions, however, revealed protein concentration-dependent but metal ion-and pH-independent pentamer accumulation at high concentrations which dissociated into tetramers and lower oligomers at low protein concentrations. While calcium appeared to stabilize the tetramer, magnesium in particular stabilized the dimer. Delta N72 existed primarily in the multimeric form under all conditions. These findings of a calcium-free NSP4 pentamer and its concentration-dependent and largely calcium-independent oligomeric transitions open up a new dimension in an understanding of the structural basis of its multitude of functions.

A new pentameric structure of rotavirus NSP4 revealed by molecular replacement

The region spanning residues 95-146 of the rotavirus nonstructural protein NSP4 from the asymptomatic human strain ST3 has been purified and crystallized and diffraction data have been collected to a resolution of 2.6 angstrom. Several attempts to solve the structure by the molecular-replacement method using the available tetrameric structures of this domain were unsuccessful despite a sequence identity of 73% to the already known structures. A more systematic approach with a dimer as the search model led to an unexpected pentameric structure using the program Phaser. The various steps involved in arriving at this molecular-replacement solution, which unravelled a case of subtle variation between different oligomeric states unknown at the time of solving the structure, are presented in this paper.