Identification of the dominant translation start site in the attB1 sequence of the pET-DEST42 Gateway vector

Gateway technology is a powerful system for converting a single entry vector into a wide variety of expression vectors. We expressed recombinant influenza matrix protein M1 (FMP), a potent antigen for cytotoxic T cells, using the Gateway vector pET-DEST42 containing the FMP cDNA, and purified the expressed FMP as a single 32 kDa recombinant protein. N-terminal and internal protein sequencing, however, showed that the recombinant FMP contained an extra 10 amino acids fused to the N-terminal of native FMP. Further investigation of the DNA sequence adjacent to the 5'-FMP cDNA indicated that the TTG in the attB1 site (30bp upstream of the ATG in the 5'-FMP cDNA) behaved as a dominant translation start site, resulting in a 10 amino acid extension of the recombinant FMP. Thus, it is possible that recombinant proteins produced by this Gateway vector contain unexpected vector-derived peptides, which may affect experimental outcomes. (c) 2006 Elsevier Inc. All rights reserved.

Molecular systematics of the Philippine malaria vector Anopheles flavirostris

Allozyme and molecular sequence data from the malaria vector Anopheles flavirostris (Ludlow) (Diptera: Culicidae) were analysed from 34 sites throughout the Philippines, including the type locality, to test the hypothesis that this taxon is a single panmictic species. A finer-scaled allozyme study, of mainly Luzon samples, revealed no fixed genetic differences in sympatric sites and only low levels of variation. We obtained data from partial sequences for the internal transcribed spacer 2 (ITS2) (483 bp), the third domain (D3) (330 bp) of the 28S ribosomal DNA subunit and cytochrome c oxidase subunit I (COI) of mitochondrial DNA (261 bp). No sequence variation was observed for ITS2, only a one base pair difference was observed between Philippine and Indonesian D3 sequences and An. flavirostris sequences were unique, confirming their diagnostic value for this taxon. Sixteen COI haplotypes were identified, giving 25 parsimony informative sites. Neighbour-Joining, Maximum Parsimony, Maximum Likelihood and Bayesian phylogenetic analysis of COI sequences for An. flavirostris and outgroup taxa revealed strong branch support for the monophyly of An. flavirostris, thus confirming that Philippine populations of this taxon comprise a single separate species within the Minimus Subgroup of the Funestus Group. Variation in the behaviour of An. flavirostris is likely to be intraspecific rather than interspecific in origin. © 2006 The Royal Entomological Society.

Predicting residue-wise contact orders in proteins by support vector regression

Background: The residue-wise contact order (RWCO) describes the sequence separations between the residues of interest and its contacting residues in a protein sequence. It is a new kind of one-dimensional protein structure that represents the extent of long-range contacts and is considered as a generalization of contact order. Together with secondary structure, accessible surface area, the B factor, and contact number, RWCO provides comprehensive and indispensable important information to reconstructing the protein three-dimensional structure from a set of one-dimensional structural properties. Accurately predicting RWCO values could have many important applications in protein three-dimensional structure prediction and protein folding rate prediction, and give deep insights into protein sequence-structure relationships. Results: We developed a novel approach to predict residue-wise contact order values in proteins based on support vector regression (SVR), starting from primary amino acid sequences. We explored seven different sequence encoding schemes to examine their effects on the prediction performance, including local sequence in the form of PSI-BLAST profiles, local sequence plus amino acid composition, local sequence plus molecular weight, local sequence plus secondary structure predicted by PSIPRED, local sequence plus molecular weight and amino acid composition, local sequence plus molecular weight and predicted secondary structure, and local sequence plus molecular weight, amino acid composition and predicted secondary structure. When using local sequences with multiple sequence alignments in the form of PSI-BLAST profiles, we could predict the RWCO distribution with a Pearson correlation coefficient (CC) between the predicted and observed RWCO values of 0.55, and root mean square error (RMSE) of 0.82, based on a well-defined dataset with 680 protein sequences. Moreover, by incorporating global features such as molecular weight and amino acid composition we could further improve the prediction performance with the CC to 0.57 and an RMSE of 0.79. In addition, combining the predicted secondary structure by PSIPRED was found to significantly improve the prediction performance and could yield the best prediction accuracy with a CC of 0.60 and RMSE of 0.78, which provided at least comparable performance compared with the other existing methods. Conclusion: The SVR method shows a prediction performance competitive with or at least comparable to the previously developed linear regression-based methods for predicting RWCO values. In contrast to support vector classification (SVC), SVR is very good at estimating the raw value profiles of the samples. The successful application of the SVR approach in this study reinforces the fact that support vector regression is a powerful tool in extracting the protein sequence-structure relationship and in estimating the protein structural profiles from amino acid sequences.

Stability for parametric implicit vector equilibrium problems

In this paper, we consider a class of parametric implicit vector equilibrium problems in Hausdorff topological vector spaces where a mapping f and a set K are perturbed by parameters is an element of and lambda respectively. We establish sufficient conditions for the upper semicontinuity and lower semicontinuity of the solution set mapping S : Lambda(1) x A(2) -> 2(X) for such parametric implicit vector equilibrium problems. (c) 2005 Elsevier Ltd. All rights reserved.

Susceptibility of source plants to Sugarcane Fiji disease virus influences the acquisition and transmission of the virus by the planthopper vector Perkinsiella saccharicida

Fiji leaf gall (FLG) caused by Sugarcane Fiji disease virus (SCFDV) is transmitted by the planthopper Perkinsiella saccharicida. FLG is managed through the identification and exploitation of plant resistance. The glasshouse-based resistance screening produced inconsistent transmission results and the factors responsible for that are not known. A series of glasshouse trials conducted over a 2-year period was compared to identify the factors responsible for the erratic transmission results. SCFDV transmission was greater when the virus was acquired by the vector from a cultivar that was susceptible to the virus than when the virus was acquired from a resistant cultivar. Virus acquisition by the vector was also greater when the vector was exposed to the susceptible cultivars than when exposed to the resistant cultivar. Results suggest that the variation in transmission levels is due to variation in susceptibility of sugarcane cultivars to SCFDV used for virus acquisition by the vector.

Detecting and sorting targeting peptides wtih neural networks and support vector machines

This paper presents a composite multi-layer classifier system for predicting the subcellular localization of proteins based on their amino acid sequence. The work is an extension of our previous predictor PProwler v1.1 which is itself built upon the series of predictors SignalP and TargetP. In this study we outline experiments conducted to improve the classifier design. The major improvement came from using Support Vector machines as a "smart gate" sorting the outputs of several different targeting peptide detection networks. Our final model (PProwler v1.2) gives MCC values of 0.873 for non-plant and 0.849 for plant proteins. The model improves upon the accuracy of our previous subcellular localization predictor (PProwler v1.1) by 2% for plant data (which represents 7.5% improvement upon TargetP).

Authorship Attribution with Support Vector Machines

In this paper we explore the use of text-mining methods for the identification of the author of a text. We apply the support vector machine (SVM) to this problem, as it is able to cope with half a million of inputs it requires no feature selection and can process the frequency vector of all words of a text. We performed a number of experiments with texts from a German newspaper. With nearly perfect reliability the SVM was able to reject other authors and detected the target author in 60–80% of the cases. In a second experiment, we ignored nouns, verbs and adjectives and replaced them by grammatical tags and bigrams. This resulted in slightly reduced performance. Author detection with SVMs on full word forms was remarkably robust even if the author wrote about different topics.

Motion vector encryption in multimedia streaming

Streaming video application requires high security as well as high computational performance. In video encryption, traditional selective algorithms have been used to partially encrypt the relatively important data in order to satisfy the streaming performance requirement. Most video selective encryption algorithms are inherited from still image encryption algorithms, the encryption on motion vector data is not considered. The assumption is that motion vector data are not as important as pixel image data. Unfortunately, in some cases, motion vector itself may be sufficient enough to leak out useful video information. Normally motion vector data consume over half of the whole video stream bandwidth, neglecting their security may be unwise. In this paper, we target this security problem and illustrate attacks at two different levels that can restore useful video information using motion vectors only. Further, an information analysis is made and a motion vector information model is built. Based on this model, we describe a new motion vector encryption algorithm called MVEA. We show the experimental results of MVEA. The security strength and performance of the algorithm are also evaluated.

Improving support vector solutions by selecting a sequence of training subsets

In this paper we demonstrate that it is possible to gradually improve the performance of support vector machine (SVM) classifiers by using a genetic algorithm to select a sequence of training subsets from the available data. Performance improvement is possible because the SVM solution generally lies some distance away from the Bayes optimal in the space of learning parameters. We illustrate performance improvements on a number of benchmark data sets.