A carboxy terminal domain of the L protein of rinderpest virus possesses RNA triphosphatase activity - The first enzyme in the viral mRNA capping pathway

The large protein L of negative-sense RNA viruses is a multifunctional protein involved in transcription and replication of genomic RNA. It also possesses enzymatic activities involved in capping and methylation of viral mRNAs. The pathway for mRNA capping followed by the L protein of the viruses in the Morbillivirus genus has not been established, although it has been speculated that these viruses may follow the unconventional capping pathway as has been shown for some viruses of Rhabdoviridae family. We had earlier shown that the large protein L of Rinderpest virus expressed as recombinant L-P complex in insect cells as well as the ribonucleoprotein complex from purified virus possesses RNA triphosphatase (RTPase) and guanylyltransferase activities, in addition to RNA dependent RNA polymerase activity. In the present work, we demonstrate that RTPase as well as nucleoside triphosphatase (NTPase) activities are exhibited by a subdomain of the L protein in the C terminal region (a.a. 1640 1840). The RTPase activity depends absolutely on a divalent cation, either magnesium or manganese. Both the RTPase and NTPase activities of the protein show dual metal specificity. Two mutant proteins having alanine mutations in the glutamic acid residues in motif-A of the RTPase domain did not show RTPase activity, while exhibiting reduced NTPase activity suggesting overlapping active sites for the two enzymatic functions. The RTPase and NTPase activities of the L subdomain resemble those of the Vaccinia capping enzyme D1 and the baculovirus LEF4 proteins. (C) 2015 Elsevier Inc. All rights reserved.

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers' constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.