Crystal Structure and Functional Analysis of the SARS-Coronavirus RNA Cap 2′-O-Methyltransferase nsp10/nsp16 Complex

Cellular and viral S-adenosylmethionine-dependent methyltransferases are involved in many regulated processes such as metabolism, detoxification, signal transduction, chromatin remodeling, nucleic acid processing, and mRNA capping. The Severe Acute Respiratory Syndrome coronavirus nsp16 protein is a S-adenosylmethionine-dependent (nucleoside-2′-O)-methyltransferase only active in the presence of its activating partner nsp10. We report the nsp10/nsp16 complex structure at 2.0 Å resolution, which shows nsp10 bound to nsp16 through a ∼930 Å2 surface area in nsp10. Functional assays identify key residues involved in nsp10/nsp16 association, and in RNA binding or catalysis, the latter likely through a SN2-like mechanism. We present two other crystal structures, the inhibitor Sinefungin bound in the S-adenosylmethionine binding pocket and the tighter complex nsp10(Y96F)/nsp16, providing the first structural insight into the regulation of RNA capping enzymes in (+)RNA viruses

The Hexamer Structure of the Rift Valley Fever Virus Nucleoprotein Suggests a Mechanism for its Assembly into Ribonucleoprotein Complexes

Rift Valley fever virus (RVFV), a Phlebovirus with a genome consisting of three single-stranded RNA segments, is spread by infected mosquitoes and causes large viral outbreaks in Africa. RVFV encodes a nucleoprotein (N) that encapsidates the viral RNA. The N protein is the major component of the ribonucleoprotein complex and is also required for genomic RNA replication and transcription by the viral polymerase. Here we present the 1.6 Å crystal structure of the RVFV N protein in hexameric form. The ring-shaped hexamers form a functional RNA binding site, as assessed by mutagenesis experiments. Electron microscopy (EM) demonstrates that N in complex with RNA also forms rings in solution, and a single-particle EM reconstruction of a hexameric N-RNA complex is consistent with the crystallographic N hexamers. The ring-like organization of the hexamers in the crystal is stabilized by circular interactions of the N terminus of RVFV N, which forms an extended arm that binds to a hydrophobic pocket in the core domain of an adjacent subunit. The conformation of the N-terminal arm differs from that seen in a previous crystal structure of RVFV, in which it was bound to the hydrophobic pocket in its own core domain. The switch from an intra- to an inter-molecular interaction mode of the N-terminal arm may be a general principle that underlies multimerization and RNA encapsidation by N proteins from Bunyaviridae. Furthermore, slight structural adjustments of the N-terminal arm would allow RVFV N to form smaller or larger ring-shaped oligomers and potentially even a multimer with a super-helical subunit arrangement. Thus, the interaction mode between subunits seen in the crystal structure would allow the formation of filamentous ribonucleocapsids in vivo. Both the RNA binding cleft and the multimerization site of the N protein are promising targets for the development of antiviral drugs

Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction

We prove a tight lower bound on the number of group operations required for batch verification by any generic-group accumulator that stores a less-than-trivial amount of information. Specifically, we show that $\Omega(t \cdot (\lambda / \log \lambda))$ group operations are required for the batch verification of any subset of $t \geq 1$ elements, where $\lambda \in \mathbb{N}$ is the security parameter, thus ruling out non-trivial batch verification in the standard non-interactive manner. Our lower bound applies already to the most basic form of accumulators (i.e., static accumulators that support membership proofs), and holds both for known-order (and even multilinear) groups and for unknown-order groups, where it matches the asymptotic performance of the known bilinear and RSA accumulators, respectively. In addition, it complements the techniques underlying the generic-group accumulators of Boneh, B{ü}nz and Fisch (CRYPTO \u2719) and Thakur (ePrint \u2719) by justifying their application of the Fiat-Shamir heuristic for transforming their interactive batch-verification protocols into non-interactive procedures. Moreover, motivated by a fundamental challenge introduced by Aggarwal and Maurer (EUROCRYPT \u2709), we propose an extension of the generic-group model that enables us to capture a bounded amount of arbitrary non-generic information (e.g., least-significant bits or Jacobi symbols that are hard to compute generically but are easy to compute non-generically). We prove our lower bound within this extended model, which may be of independent interest for strengthening the implications of impossibility results in idealized models

The spatial scaling of species interaction networks

International audienceSpecies-area relationships (SARs) are pivotal to understand the distribution of biodiversity across spatial scales. We know little, however, about how the network of biotic interactions in which biodiversity is embedded changes with spatial extent. Here we develop a new theoretical framework that enables us to explore how different assembly mechanisms and theoretical models affect multiple properties of ecological networks across space. We present a number of testable predictions on network-area relationships (NARs) for multi-trophic communities. Network structure changes as area increases because of the existence of different SARs across trophic levels, the preferential selection of generalist species at small spatial extents and the effect of dispersal limitation promoting beta-diversity. Developing an understanding of NARs will complement the growing body of knowledge on SARs with potential applications in conservation ecology. Specifically, combined with further empirical evidence, NARs can generate predictions of potential effects on ecological communities of habitat loss and fragmentation in a changing world