A Hydrophobic Network: Intersubunit and Intercapsomer Interactions Stabilizing the Bacteriophage P22 Capsid.

Double-stranded DNA (dsDNA) tailed phages and herpesviruses assemble their capsids using coat proteins that have the ubiquitous HK97 fold. Though this fold is common, we do not have a thorough understanding of the different ways viruses adapt it to maintain stability in various environments. The HK97-fold E-loop, which connects adjacent subunits at the outer periphery of capsomers, has been implicated in capsid stability. Here, we show that in bacteriophage P22, residue W61 at the tip of the E-loop plays a role in stabilizing procapsids and in maturation. We hypothesize that a hydrophobic pocket is formed by residues I366 and W410 in the P domain of a neighboring subunit within a capsomer, into which W61 fits like a peg. In addition, W61 likely bridges to residues A91 and L401 in P-domain loops of an adjacent capsomer, thereby linking the entire capsid together with a network of hydrophobic interactions. There is conservation of this hydrophobic network in the distantly related P22-like phages, indicating that this structural feature is likely important for stabilizing this family of phages. Thus, our data shed light on one of the varied elegant mechanisms used in nature to consistently build stable viral genome containers through subtle adaptation of the HK97 fold.IMPORTANCE Similarities in assembly reactions and coat protein structures of the dsDNA tailed phages and herpesviruses make phages ideal models to understand capsid assembly and identify potential targets for antiviral drug discovery. The coat protein E-loops of these viruses are involved in both intra- and intercapsomer interactions. In phage P22, hydrophobic interactions peg the coat protein subunits together within a capsomer, where the E-loop hydrophobic residue W61 of one subunit packs into a pocket of hydrophobic residues I366 and W410 of the adjacent subunit. W61 also makes hydrophobic interactions with A91 and L401 of a subunit in an adjacent capsomer. We show these intra- and intercapsomer hydrophobic interactions form a network crucial to capsid stability and proper assembly

Portal protein functions akin to a DNA-sensor that couples genome-packaging to icosahedral capsid maturation.

Tailed bacteriophages and herpesviruses assemble infectious particles via an empty precursor capsid (or \u27procapsid\u27) built by multiple copies of coat and scaffolding protein and by one dodecameric portal protein. Genome packaging triggers rearrangement of the coat protein and release of scaffolding protein, resulting in dramatic procapsid lattice expansion. Here, we provide structural evidence that the portal protein of the bacteriophage P22 exists in two distinct dodecameric conformations: an asymmetric assembly in the procapsid (PC-portal) that is competent for high affinity binding to the large terminase packaging protein, and a symmetric ring in the mature virion (MV-portal) that has negligible affinity for the packaging motor. Modelling studies indicate the structure of PC-portal is incompatible with DNA coaxially spooled around the portal vertex, suggesting that newly packaged DNA triggers the switch from PC- to MV-conformation. Thus, we propose the signal for termination of \u27Headful Packaging\u27 is a DNA-dependent symmetrization of portal protein

A wavelet based numerical method for nonlinear partial differential equations

The purpose of this paper is to present a wavelet–Galerkin scheme for solving nonlinear elliptic partial differential equations. We select as trial spaces a nested sequence of spaces from an appropriate biorthogonal multiscale analysis. This gives rise to a nonlinear discretized system. To overcome the problems of nonlinearity, we apply the machinery of interpolating wavelets to obtain knot oriented quadrature rules. Finally, Newton’s method is applied to approximate the solution in the given ansatz space. The results of some numerical experiments with different biorthogonal systems, confirming the applicability of our scheme, are presented.Instituto de Cooperação Científica e Tecnológica Internacional - Acções Integradas Luso-Alemãs (DAAD/ICCTI) - Projecto DAAD/ICCTI nº 01141

Eurasian house mouse (Mus musculus L.) differentiation at microsatellite loci identifies the Iranian plateau as a phylogeographic hotspot

Background: The phylogeography of the house mouse (Mus musculus L.), an emblematic species for genetic and biomedical studies, is only partly understood, essentially because of a sampling bias towards its most peripheral populations in Europe, Asia and the Americas. Moreover, the present-day phylogeographic hypotheses stem mostly from the study of mitochondrial lineages. In this article, we complement the mtDNA studies with a comprehensive survey of nuclear markers (19 microsatellite loci) typed in 963 individuals from 47 population samples, with an emphasis on the putative Middle-Eastern centre of dispersal of the species. Results: Based on correspondence analysis, distance and allele-sharing trees, we find a good coherence between geographical origin and genetic make-up of the populations. We thus confirm the clear distinction of the three best described peripheral subspecies, M. m. musculus, M. m. domesticus and M. m. castaneus. A large diversity was found in the Iranian populations, which have had an unclear taxonomic status to date. In addition to samples with clear affiliation to M. m. musculus and M. m. domesticus, we find two genetic groups in Central and South East Iran, which are as distinct from each other as they are from the south-east Asian M. m. castaneus. These groups were previously also found to harbor distinct mitochondrial haplotypes. Conclusion: We propose that the Iranian plateau is home to two more taxonomic units displaying complex primary and secondary relationships with their long recognized neighbours. This central region emerges as the area with the highest known diversity of mouse lineages within a restricted geographical area, designating it as the focal place to study the mechanisms of speciation and diversification of this species

A common and unstable copy number variant is associated with differences in Glo1 expression and anxiety-like behavior

Glyoxalase 1 (Glo1) has been implicated in anxiety-like behavior in mice and in multiple psychiatric diseases in humans. We used mouse Affymetrix exon arrays to detect copy number variants (CNV) among inbred mouse strains and thereby identified a approximately 475 kb tandem duplication on chromosome 17 that includes Glo1 (30,174,390-30,651,226 Mb; mouse genome build 36). We developed a PCR-based strategy and used it to detect this duplication in 23 of 71 inbred strains tested, and in various outbred and wild-caught mice. Presence of the duplication is associated with a cis-acting expression QTL for Glo1 (LOD>30) in BXD recombinant inbred strains. However, evidence for an eQTL for Glo1 was not obtained when we analyzed single SNPs or 3-SNP haplotypes in a panel of 27 inbred strains. We conclude that association analysis in the inbred strain panel failed to detect an eQTL because the duplication was present on multiple highly divergent haplotypes. Furthermore, we suggest that non-allelic homologous recombination has led to multiple reversions to the non-duplicated state among inbred strains. We show associations between multiple duplication-containing haplotypes, Glo1 expression and anxiety-like behavior in both inbred strain panels and outbred CD-1 mice. Our findings provide a molecular basis for differential expression of Glo1 and further implicate Glo1 in anxiety-like behavior. More broadly, these results identify problems with commonly employed tests for association in inbred strains when CNVs are present. Finally, these data provide an example of biologically significant phenotypic variability in model organisms that can be attributed to CNVs.These studies were funded by MH070933, MH79103 and MH020065

Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints

Regularization of ill-posed linear inverse problems via $\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\ell_1$ penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to $\ell_1$-constraints, using a gradient method, with projection on $\ell_1$-balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of the (linear) steepest descent method. We prove convergence in norm for one of these projected gradient methods, without and with acceleration.Comment: 24 pages, 5 figures. v2: added reference, some amendments, 27 page