Differentiation of rinderpest and peste des petits ruminants viruses using specific cDNA clones

The morbilliviruses which infect ruminants, rinderpest (RPV) and peste des petits ruminants (PPRV), are difficult to distinguish serologically. They can be distinguished by differential neutralisation tests and by the migration of the major virus structural protein, the nucleocapsid protein, on polyacrylamide gels. Both these methods are time consuming and require the isolation of live virus for identification; they are not suitable for analysis of material directly from post-mortem specimens. We describe a rapid method for differential diagnosis of infections caused by RPV or PPRV, which uses specific cDNA probes, derived from the mRNAs for the nucleocapsid protein of each virus, which can be used to distinguish unequivocally the two virus types rapidly.

Molecular and serological studies on the recent seal virus epizootics in Europe and Siberia

The virus epizootics which occurred in seals in both Europe and Siberia during 1987/1988 were caused by two different morbillivirus, referred to as phocid distemper virus (PDV) 1 and 2, respectively. Molecular and serological studies have shown that the European virus is quite distinct from canine distemper virus (CDV), its closest relative in the morbillivirus group. Analysis of tissues obtained from infected seals from a wide geographical distrubution over Northern Europe showed that the infectious agent (PDV 1) was identical in all cases. Nucleotide sequence analysis of one of the virus genes suggested that this virus has evolved away from CDV over a long time period and is most probably an enzootic virus of marine mammals. In contrast, the virus (PDV 2) which caused the deaths of many Siberian seals was indistinguishable, both serologically and at the molecular level, from CDV and must have originated from a land source.

Accelerating Reduction for Enabling Fast Multiplication over Large Binary Fields

In this paper we present a hardware-software hybrid technique for modular multiplication over large binary fields. The technique involves application of Karatsuba-Ofman algorithm for polynomial multiplication and a novel technique for reduction. The proposed reduction technique is based on the popular repeated multiplication technique and Barrett reduction. We propose a new design of a parallel polynomial multiplier that serves as a hardware accelerator for large field multiplications. We show that the proposed reduction technique, accelerated using the modified polynomial multiplier, achieves significantly higher performance compared to a purely software technique and other hybrid techniques. We also show that the hybrid accelerated approach to modular field multiplication is significantly faster than the Montgomery algorithm based integrated multiplication approach.