A high-copy T7 Escherichia coli expression vector for the production of recombinant proteins with a minimal N-terminal His-tagged fusion peptide

We report here the construction of a vector derived from pET3-His and pRSET plasmids for the expression and purification of recombinant proteins in Escherichia coli based on T7 phage RNA polymerase. The resulting pAE plasmid combined the advantages of both vectors: small size (pRSET), expression of a short 6XHis tag at N-terminus (pET3-His) and a high copy number of plasmid (pRSET). The small size of the vector (2.8 kb) and the high copy number/cell (200-250 copies) facilitate the subcloning and sequencing procedures when compared to the pET system (pET3-His, 4.6 kb and 40-50 copies) and also result in high level expression of recombinant proteins (20 mg purified protein/liter of culture). In addition, the vector pAE enables the expression of a fusion protein with a minimal amino-terminal hexa-histidine affinity tag (a tag of 9 amino acids using XhoI restriction enzyme for the 5'cloning site) as in the case of pET3-His plasmid and in contrast to proteins expressed by pRSET plasmids (a tag of 36 amino acids using BamHI restriction enzyme for the 5'cloning site). Thus, although proteins expressed by pRSET plasmids also have a hexa-histidine tag, the fusion peptide is much longer and may represent a problem for some recombinant proteins.

Construction of bovine adenovirus type 3 E1 and E3, substitution plasmids and the sequencing analysis of DNA pol and pTP /

The relative ease to concentrate and purify adenoviruses, their well characterized mid-sized genome, and the ability to delete non-essential regions from their genome to accommodate foreign gene, made adenoviruses a suitable candidate for the construction of vectors. The use of adenoviral vectors in gene therapy, vaccination, and as a general vector system for expressing foreign genes have been documented for some time. In this study, the objective was to rescue a BAV3 E1 or E3 recombinant vector carrying the kanamycin resistant gene, a dominant selectable marker with useful applications in studying vectored gene expression in mammalian cells. To accomplish the objective of this study, more information about BAV3 DNA sequences was required in order to make the manipulation of the virus genome accessible. Therefore, sequencing of the BAV3 genome from 1 1 .7% to 30.8% was carried out. Analysis of the determined sequences revealed the primary structure of important viral gene products coded by E2 including BAV3 DNA pol and precursor to terminal protein. Comparative analysis of these proteins with their counterparts from human and non human adenoviruses revealed important insights as to the evolutionary lineage of BAV3. In order to insert the kanamycin resistance gene in either E1 or E3, it was necessary to delete BAV3 sequences to accommodate the foreign gene so as not to exceed the limit of the packaging capacity of the virus. To construct a recombinant BAV3 in which a foreign gene was inserted in the deleted E1 region, an E1 shuttle vector was constructed. This involved the deletion from the viral sequences a region between 1.3% to 9% and inserting the kanamycin resistance gene to replace the deletion. The E1 shuttle vector contained the left (0%- 53.9%) segment of the genome and was expected to generate BAV3 recombinants that can be grown and propagated in cells that can complement the missing E1 functions. To construct a similar shuttle vector for E3 deletion, DNA sequences extending from 78.9% to 82.5% (1281 bp) were deleted from within the E3 region that had been cloned into a plasmid vector. The deleted region corresponds to those that have been shown to be non-essential for viral replication in cell culture. The resulting plasmid was used to construct another recombinant plasmid with BAV3 DNA sequences extending from 37.1% to 100% and with a deletion of E3 sequences that were replaced by kanamycin resistance gene. This shuttle plasmid was used in cotransfections with digested viral DNA in an attempt to rescue a recombinant BAV3 carrying the kanamycin resistance gene to replace the deleted E3. In spite of repeated attempts of transfection, El or E3 recombinant BAV3 were not isolated. It seems that other approaches should be applied to make a final conclusion on BAV3 infectivity.

Pratiques associatives et construction d'un espace social citoyen à Trou du Nord (Haïti)

Ce mémoire traite de la construction d’un espace social citoyen à partir de l’analyse du travail d’intervention de deux organismes locaux situés à Trou du Nord (Haïti). Il s’agit d’explorer les manières dont les membres se représentent et s’approprient leur statut de citoyen. Pour mettre l’emphase sur les mécanismes associatifs et sociaux qui interviennent dans la construction de ce que nous nommons "espace social citoyen", nous avons mené une recherche qualitative dont la charpente interprétative est conçue avec l’aide des outils théorico-pratiques de la politique de participation (Barber, 1997) et l’intervention sociale collective (Lamoureux, 1991). Nous avançons l’hypothèse centrale que les pratiques associatives sont le vecteur de la construction d’un espace social citoyen à Trou du Nord. Cette hypothèse centrale est soutenue par deux hypothèses opératoires portant sur les conditions d’exercice de citoyenneté et l’affirmation individuelle de l’appartenance des membres à l’espace commun. Nous avons recueilli quatorze entretiens semi-directifs effectués avec les membres de l’Assemblée Populaire Veye Yo Trou du Nord (APVT) et du Rassemblement des Militants Solidaires de Trou du Nord (RAMSO). Les résultats de la recherche indiquent que les membres de ces deux organisations manifestent une grande volonté de contribuer au développement de leur localité et au «mieux-être» de la population. Leur implication directe dans les affaires politiques et sociales s’accompagne des exigences pour que l’État prenne en charge ses responsabilités vis-à-vis de ses citoyens. Cette liberté d’action repose sur le partage de leurs expériences individuelles et sur une grande connaissance des divers aspects des réalités locales auxquelles sont confrontés quotidiennement les citoyens. Ces deux groupes sont conçus comme des espaces de sociabilité, des lieux publics et dynamiques issus de l’activité commune et des divers types d’interactions au niveau local. Toujours d’après l’analyse, les membres de ces deux groupes interviennent sur un problème d’ensemble collectif au niveau local sans pour autant négliger leurs propres intérêts. Ils s’inscrivent dans le jeu de marchandage électoral et apprennent à leurs membres à se comporter comme une communauté d’intérêts et d’actions, elle-même inscrite dans l’ensemble des interactions, des processus et des dynamiques de résolution des problèmes au niveau local. Un tel constat vient à la fois valider certaines de nos hypothèses tout en révélant les limites de l’idée de la construction d’un espace social citoyen. D’une part, la volonté de contribuer au «mieux-être» de la population, la nécessité de prendre la parole, d’exprimer les problèmes collectifs et individuels, le souci d’avoir un contrôle sur l’action des dirigeants élus sont autant d’enjeux qui leur ont permis de passer de leur vécu particulier à une vision plus large des intérêts collectifs et à la définition des tâches qu’ils estiment correspondre au rôle citoyen qui leur incombe. D’autre part, leur positionnement dans le champ politique notamment au moment des élections les fait apparaître comme des groupes partisans, c'est-à-dire qu’ils ne sont pas toujours dans la construction de l’intérêt général. Nous concluons que ce double aspect s’avère nécessaire aussi bien à la construction de l’espace social citoyen qu’au fonctionnement démocratique au niveau local. Car, en plus de se définir comme citoyens et d’affirmer leur appartenance communautaire, les membres développent les capacités critiques face aux gestes et actes posés autant par les dirigeants locaux que par l’État haïtien lui-même. Ils acquièrent aussi les habilités de participer, même dans les interstices, aux jeux sociopolitiques faisant partie du processus de renforcement de la citoyenneté et d’un système démocratique en construction.

Développement de procédés efficaces pour la construction et la production de vecteurs adénoviraux

L’adénovirus possède plusieurs caractéristiques faisant de ce virus un candidat de choix pour la construction de vecteurs utiles dans les études de génomique fonctionnelle. Dans la majorité de ces applications, on a recours à un vecteur adénoviral de première génération délété de sa région E1. L’utilisation de vecteurs adénoviraux comprend deux maillons faibles : la construction du vecteur et la production subséquente de ce dernier. Le développement de méthodes alternatives est donc nécessaire pour renforcer ces deux maillons, permettant ainsi une utilisation étendue de ces vecteurs. Ce développement va s’articuler sur deux axes : l’ingénierie du vecteur de transfert pour la construction de l’adénovirus recombinant et l’ingénierie d’une lignée cellulaire pour la production du vecteur. En utilisant un vecteur de transfert adénoviral co-exprimant, à partir d’un promoteur régulable à la tétracycline, la protéase de l’adénovirus et une protéine de fluorescence verte (GFP) par l’intermédiaire d’un site d’entrée ribosomal interne (IRES), notre groupe a établi que la sélection positive, via l’expression ectopique de la protéase, est un processus efficace pour la création de librairie d’adénovirus recombinants. Par contre, la diversité atteinte dans ce premier système est relativement faible, environ 1 adénovirus recombinant par 1 000 cellules. Le travail effectué dans le cadre de cette thèse vise à construire un nouveau transfert de vecteur dans lequel l’expression de la protéase sera indépendante de celle du transgène permettant ainsi d’optimiser l’expression de la protéase. Ce travail d’optimisation a permis de réduire le phénomène de transcomplémentation du virus parental ce qui a fait grimper la diversité à 1 virus recombinant par 75 cellules. Ce système a été mis à l’épreuve en générerant une librairie adénovirale antisens dirigée contre la GFP. La diversité de cette librairie a été suffisante pour sélectionner un antisens réduisant de 75% l’expression de la GFP. L’amplification de ce vecteur adénoviral de première génération doit se faire dans une lignée cellulaire exprimant la région E1 telle que les cellules 293. Par contre, un adénovirus de première génération se répliquant dans les cellules 293 peut échanger, par recombinaison homologue, son transgène avec la région E1 de la cellule créant ainsi un adénovirus recombinant réplicatif (RCA), compromettant ainsi la pureté des stocks. Notre groupe a déjà breveté une lignée cellulaire A549 (BMAdE1) exprimant la région E1, mais qui ne peut pas recombiner avec le transgène du virus. Par contre, le niveau de réplication de l’adénovirus dans les BMAdE1 est sous-optimal, à peine 15-30% du niveau obtenu dans les cellules 293. Le travail fait dans le cadre de cette thèse a permis de mettre en évidence qu’une expression insuffisante d’E1B-55K était responsable de la mauvaise réplication du virus dans les BMAdE1. Nous avons produit de nouveaux clones à partir de la lignée parentale via une transduction avec un vecteur lentiviral exprimant E1B-55K. Nous avons confirmé que certains clones exprimaient une plus grande quantité d’E1B-55K et que ces clones amplifiaient de manière plus efficace un vecteur adénoviral de première génération. Ce clone a par la suite été adapté à la culture en suspension sans sérum.

Sparse kernel density construction using orthogonal forward regression with leave-one-out test score and local regularization

This paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model generalization capability. Computational efficiency of the density construction is ensured using an orthogonal forward regression, and the algorithm incrementally minimizes the leave-one-out test score. A local regularization method is incorporated naturally into the density construction process to further enforce sparsity. An additional advantage of the proposed algorithm is that it is fully automatic and the user is not required to specify any criterion to terminate the density construction procedure. This is in contrast to an existing state-of-art kernel density estimation method using the support vector machine (SVM), where the user is required to specify some critical algorithm parameter. Several examples are included to demonstrate the ability of the proposed algorithm to effectively construct a very sparse kernel density estimate with comparable accuracy to that of the full sample optimized Parzen window density estimate. Our experimental results also demonstrate that the proposed algorithm compares favorably with the SVM method, in terms of both test accuracy and sparsity, for constructing kernel density estimates.

Construction of tunable radial basis function networks using orthogonal forward selection

An orthogonal forward selection (OFS) algorithm based on leave-one-out (LOO) criteria is proposed for the construction of radial basis function (RBF) networks with tunable nodes. Each stage of the construction process determines an RBF node, namely, its center vector and diagonal covariance matrix, by minimizing the LOO statistics. For regression application, the LOO criterion is chosen to be the LOO mean-square error, while the LOO misclassification rate is adopted in two-class classification application. This OFS-LOO algorithm is computationally efficient, and it is capable of constructing parsimonious RBF networks that generalize well. Moreover, the proposed algorithm is fully automatic, and the user does not need to specify a termination criterion for the construction process. The effectiveness of the proposed RBF network construction procedure is demonstrated using examples taken from both regression and classification applications.

Kernel classifier construction using orthogonal forward selection and boosting with Fisher ratio class separability measure

A greedy technique is proposed to construct parsimonious kernel classifiers using the orthogonal forward selection method and boosting based on Fisher ratio for class separability measure. Unlike most kernel classification methods, which restrict kernel means to the training input data and use a fixed common variance for all the kernel terms, the proposed technique can tune both the mean vector and diagonal covariance matrix of individual kernel by incrementally maximizing Fisher ratio for class separability measure. An efficient weighted optimization method is developed based on boosting to append kernels one by one in an orthogonal forward selection procedure. Experimental results obtained using this construction technique demonstrate that it offers a viable alternative to the existing state-of-the-art kernel modeling methods for constructing sparse Gaussian radial basis function network classifiers. that generalize well.

Radial basis function classifier construction using particle swarm optimisation aided orthogonal forward regression

We develop a particle swarm optimisation (PSO) aided orthogonal forward regression (OFR) approach for constructing radial basis function (RBF) classifiers with tunable nodes. At each stage of the OFR construction process, the centre vector and diagonal covariance matrix of one RBF node is determined efficiently by minimising the leave-one-out (LOO) misclassification rate (MR) using a PSO algorithm. Compared with the state-of-the-art regularisation assisted orthogonal least square algorithm based on the LOO MR for selecting fixednode RBF classifiers, the proposed PSO aided OFR algorithm for constructing tunable-node RBF classifiers offers significant advantages in terms of better generalisation performance and smaller model size as well as imposes lower computational complexity in classifier construction process. Moreover, the proposed algorithm does not have any hyperparameter that requires costly tuning based on cross validation.

Neurofuzzy mixture of experts network parallel learning and model construction algorithms

A connection between a fuzzy neural network model with the mixture of experts network (MEN) modelling approach is established. Based on this linkage, two new neuro-fuzzy MEN construction algorithms are proposed to overcome the curse of dimensionality that is inherent in the majority of associative memory networks and/or other rule based systems. The first construction algorithm employs a function selection manager module in an MEN system. The second construction algorithm is based on a new parallel learning algorithm in which each model rule is trained independently, for which the parameter convergence property of the new learning method is established. As with the first approach, an expert selection criterion is utilised in this algorithm. These two construction methods are equivalent in their effectiveness in overcoming the curse of dimensionality by reducing the dimensionality of the regression vector, but the latter has the additional computational advantage of parallel processing. The proposed algorithms are analysed for effectiveness followed by numerical examples to illustrate their efficacy for some difficult data based modelling problems.

Neurofuzzy network model construction using Bézier-Bernstein polynomial functions

Neurofuzzy modelling systems combine fuzzy logic with quantitative artificial neural networks via a concept of fuzzification by using a fuzzy membership function usually based on B-splines and algebraic operators for inference, etc. The paper introduces a neurofuzzy model construction algorithm using Bezier-Bernstein polynomial functions as basis functions. The new network maintains most of the properties of the B-spline expansion based neurofuzzy system, such as the non-negativity of the basis functions, and unity of support but with the additional advantages of structural parsimony and Delaunay input space partitioning, avoiding the inherent computational problems of lattice networks. This new modelling network is based on the idea that an input vector can be mapped into barycentric co-ordinates with respect to a set of predetermined knots as vertices of a polygon (a set of tiled Delaunay triangles) over the input space. The network is expressed as the Bezier-Bernstein polynomial function of barycentric co-ordinates of the input vector. An inverse de Casteljau procedure using backpropagation is developed to obtain the input vector's barycentric co-ordinates that form the basis functions. Extension of the Bezier-Bernstein neurofuzzy algorithm to n-dimensional inputs is discussed followed by numerical examples to demonstrate the effectiveness of this new data based modelling approach.

An investigation into feature construction to assist word sense disambiguation

Identifying the correct sense of a word in context is crucial for many tasks in natural language processing (machine translation is an example). State-of-the art methods for Word Sense Disambiguation (WSD) build models using hand-crafted features that usually capturing shallow linguistic information. Complex background knowledge, such as semantic relationships, are typically either not used, or used in specialised manner, due to the limitations of the feature-based modelling techniques used. On the other hand, empirical results from the use of Inductive Logic Programming (ILP) systems have repeatedly shown that they can use diverse sources of background knowledge when constructing models. In this paper, we investigate whether this ability of ILP systems could be used to improve the predictive accuracy of models for WSD. Specifically, we examine the use of a general-purpose ILP system as a method to construct a set of features using semantic, syntactic and lexical information. This feature-set is then used by a common modelling technique in the field (a support vector machine) to construct a classifier for predicting the sense of a word. In our investigation we examine one-shot and incremental approaches to feature-set construction applied to monolingual and bilingual WSD tasks. The monolingual tasks use 32 verbs and 85 verbs and nouns (in English) from the SENSEVAL-3 and SemEval-2007 benchmarks; while the bilingual WSD task consists of 7 highly ambiguous verbs in translating from English to Portuguese. The results are encouraging: the ILP-assisted models show substantial improvements over those that simply use shallow features. In addition, incremental feature-set construction appears to identify smaller and better sets of features. Taken together, the results suggest that the use of ILP with diverse sources of background knowledge provide a way for making substantial progress in the field of WSD.

Overexpression and Purification of the Oat (Avena Fatua) Protein AFN1 and Construction of a pMAL/AFN1 Expression Plasmid

Abscisic acid (ABA) is an important phytohormone with regulatory roles in many physiological processes. ABA expression is induced by environmental stresses such as drought and it is known to be an inhibitor of seed germination. A wild oat (Avena fatua) called AFN1 has been hypothesized to initiate the early stages of germination as its mRNA accumulates in nondormant seed embryos during imbibition. The polypeptide sequence of AFN1 suggests that it is an ABA glucosyl transferase. Glucosylation by AFN1 and thereby inactivation of ABA could lead to seed germination. In order to understand the role of AFN1 in germination, an ample quantity of AFN1 polypeptide is needed to test for enzymatic ABA glucosylase activity. My work has been to overexpress recombinant AFN1containing a (His)6 tag using a pRSETC E.coli expression system followed by Purification of the AFN1 protein by means of a nickel-affinity column that bind to the (His)6 tag. Due to the insufficient yield of AFN1 fusion protein obtained with this procedure, another method using a pMAL-c2x vector is now being employed. The pMAL expression system provides a method for expressing and purifying protein by tagging proteins with maltose-binding protein (MBP). It is anticipated that MBP tag will be advantageous as it can make the fusion protein more soluble and thereby yield a larger quantity of protein. Currently, work is underway on the construction of pMAL/AFN1 plasmid.

Verification Of The Standard Vector Data Model For Interoperability Of River-Geospatial Information

Recently, two international standard organizations, ISO and OGC, have done the work of standardization for GIS. Current standardization work for providing interoperability among GIS DB focuses on the design of open interfaces. But, this work has not considered procedures and methods for designing river geospatial data. Eventually, river geospatial data has its own model. When we share the data by open interface among heterogeneous GIS DB, differences between models result in the loss of information. In this study a plan was suggested both to respond to these changes in the information envirnment and to provide a future Smart River-based river information service by understanding the current state of river geospatial data model, improving, redesigning the database. Therefore, primary and foreign key, which can distinguish attribute information and entity linkages, were redefined to increase the usability. Database construction of attribute information and entity relationship diagram have been newly redefined to redesign linkages among tables from the perspective of a river standard database. In addition, this study was undertaken to expand the current supplier-oriented operating system to a demand-oriented operating system by establishing an efficient management of river-related information and a utilization system, capable of adapting to the changes of a river management paradigm.

T-duality of axial and vector dyonic integrable models

A general construction of affine nonabelian (NA)-Toda models in terms of the axial and vector gauged two loop WZNW model is discussed. They represent integrable perturbations of the conformal sigma -models (with tachyons included) describing (charged) black hole type string backgrounds. We study the off-critical T-duality between certain families of axial and vector type integrable models for the case of affine NA-Toda theories with one global U(1) symmetry. In particular we find the Lie algebraic condition defining a subclass of T-selfdual torsionless NA-Toda models and their zero curvature representation. (C) 2001 Academic Press.

Construction and decoding of BCH codes over finite commutative rings

BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.