Effect of acyl chain length on transfection efficiency and toxicity of polyethylenimine

Polyethylenimine (PEI) is an efficient nonviral gene delivery vector because of its high buffering capacity and DNA condensation ability. In our study, the amino groups on the polymeric backbone were acylated using acetic or propionic anhydride to alter the protonation behaviour and the hydrophilic/hydrophobic balance of the polymer. The concentration of acylated primary amines was determined using trinitrobenzene sulphonic acid assay. Results showed that our modified polymers had lower buffering capacities in solutions compared to PEI. The polymers were complexed with plasmid encoding enhanced green fluorescent protein at three different ratios (1:1, 1:2 and 1:10 w/w DNA to polymer) to form polyplexes and their toxicities and transfection efficiencies were evaluated in HEK 293 cells. Acylation reduced the number of primary amines on the polymer and the surface charge, improving haemocompatibility and reducing cytotoxicity. The reduction in the concentration of amino groups helped to optimise DNA compaction and facilitated polyplex dissociation in the cell, which increased transfection efficiency of the modified polymers compared to the parent polymer. Polymers with buffering capacities greater than 50% and less than 80% relative to PEI, showed higher transfection efficiencies than PEI. The propionic anhydride modified polymers had appropriate interactions with DNA which provided both DNA compaction and polyplex dissociation. These systems interacted better with the cell membrane because of their slightly higher lipophilicity and formed polyplexes which were less cytotoxic than polyplexes of acetic anhydride modified polymers. Among the vectors tested, 1:0.3 mol/mol PEI:propionic anhydride in a 1:2 w/w DNA:polymer composition provided the best transfection system with improved transfection efficiency and reduced cytotoxicity.

The relationships of age and length of service with job satisfaction: an examination of hotel employees in Thailand

Earlier studies suggest age is positively associated with job satisfaction, while others use length of service, or tenure, as a predictor of job satisfaction levels. This article examines whether age and tenure are individual determinants of satisfaction, or whether there is an interaction between the two. The results indicate that employee age is not significantly associated with overall job satisfaction level, but that tenure is. There is also significant relationship between tenure and facets of satisfaction (job, pay and fringe benefits), but the effect of tenure on satisfaction is significantly modified by age.

An approximate Bayesian computation approach to overcome biases that arise when using amplified fragment length polymorphism markers to study population structure

There is great interest in using amplified fragment length polymorphism (AFLP) markers because they are inexpensive and easy to produce. It is, therefore, possible to generate a large number of markers that have a wide coverage of species genotnes. Several statistical methods have been proposed to study the genetic structure using AFLP's but they assume Hardy-Weinberg equilibrium and do not estimate the inbreeding coefficient, F-IS. A Bayesian method has been proposed by Holsinger and colleagues that relaxes these simplifying assumptions but we have identified two sources of bias that can influence estimates based on these markers: (i) the use of a uniform prior on ancestral allele frequencies and (ii) the ascertainment bias of AFLP markers. We present a new Bayesian method that avoids these biases by using an implementation based on the approximate Bayesian computation (ABC) algorithm. This new method estimates population-specific F-IS and F-ST values and offers users the possibility of taking into account the criteria for selecting the markers that are used in the analyses. The software is available at our web site (http://www-leca.uif-grenoble.fi-/logiciels.htm). Finally, we provide advice on how to avoid the effects of ascertainment bias.

Amplified fragment length polymorphism genetic fingerprinting challenges the taxonomic status of the near-endemic species Chara curta Nolte ex Kutz. (Characeae)

Amplified fragment length polymorphism (AFLP) genetic fingerprinting of 14 accessions of Chara curta and Chara aspera Willd., sampled across a range of habitats and morphologies in Britain, suggests that these taxa are part of the variation within a single species complex. Two primer combinations generating 397 fragments (97% of which were polymorphic), analysed by Jaccard's similarity coefficient and principal co-ordinate analysis, did not recover groups which reflect the current taxonomy. By contrast with the genetic study, a Gower general similarity coefficient and principal co-ordinate analysis of 52 morphological characters recovered the currently recognized species groups. A Mantel test showed no significant correlation between the genetic data and the morphological data, supporting the hypothesis that phenotypic variability in Chara L. is either to some extent environmentally induced or represents developmental stages. Implications for the conservation status of C. curta in Britain are discussed. (c) 2007 The Linnean Society of London, Botanical Journal of the Linnean Society, 2007, 155, 467-476.

Analysis of the antigen combining site: Correlations between length and sequence composition of the hypervariable loops and the nature of the antigen

It has long been suggested that the overall shape of the antigen combining site (ACS) of antibodies is correlated with the nature of the antigen. For example, deep pockets are characteristic of antibodies that bind haptens, grooves indicate peptide binders, while antibodies that bind to proteins have relatively flat combining sites. In. 1996, MacCallum, Martin and Thornton used a fractal shape descriptor and showed a strong correlation of the shape of the binding region with the general nature of the antigen. However, the shape of the ACS is determined primarily by the lengths of the six complementarity-determining regions (CDRs). Here, we make a direct correlation between the lengths of the CDRs and the nature of the antigen. In addition, we show significant differences in the residue composition of the CDRs of antibodies that bind to different antigen classes. As well as helping us to understand the process of antigen recognition, autoimmune disease and cross-reactivity these results are of direct application in the design of antibody phage libraries and modification of affinity. (C) 2003 Elsevier Science Ltd. All rights reserved.

Synapsing variable length crossover: Biologically inspired crossover for variable length genomes

Biological Crossover occurs during the early stages of meiosis. During this process the chromosomes undergoing crossover are synapsed together at a number of homogenous sequence sections, it is within such synapsed sections that crossover occurs. The SVLC (Synapsing Variable Length Crossover) Algorithm recurrently synapses homogenous genetic sequences together in order of length. The genomes are considered to be flexible with crossover only being permitted within the synapsed sections. Consequently, common sequences are automatically preserved with only the genetic differences being exchanged, independent of the length of such differences. In addition to providing a rationale for variable length crossover it also provides a genotypic similarity metric for variable length genomes enabling standard niche formation techniques to be utilised. In a simple variable length test problem the SVLC algorithm outperforms current variable length crossover techniques.

Synapsing variable length crossover: An algorithm for crossing and comparing variable length genomes

The Synapsing Variable Length Crossover (SVLC) algorithm provides a biologically inspired method for performing meaningful crossover between variable length genomes. In addition to providing a rationale for variable length crossover it also provides a genotypic similarity metric for variable length genomes enabling standard niche formation techniques to be used with variable length genomes. Unlike other variable length crossover techniques which consider genomes to be rigid inflexible arrays and where some or all of the crossover points are randomly selected, the SVLC algorithm considers genomes to be flexible and chooses non-random crossover points based on the common parental sequence similarity. The SVLC Algorithm recurrently "glues" or synapses homogenous genetic sub-sequences together. This is done in such a way that common parental sequences are automatically preserved in the offspring with only the genetic differences being exchanged or removed, independent of the length of such differences. In a variable length test problem the SVLC algorithm is shown to outperform current variable length crossover techniques. The SVLC algorithm is also shown to work in a more realistic robot neural network controller evolution application.

Synapsing variable-length crossover: Meaningful crossover for variable-length genomes

The synapsing variable-length crossover (SVLC algorithm provides a biologically inspired method for performing meaningful crossover between variable-length genomes. In addition to providing a rationale for variable-length crossover, it also provides a genotypic similarity metric for variable-length genomes, enabling standard niche formation techniques to be used with variable-length genomes. Unlike other variable-length crossover techniques which consider genomes to be rigid inflexible arrays and where some or all of the crossover points are randomly selected, the SVLC algorithm considers genomes to be flexible and chooses non-random crossover points based on the common parental sequence similarity. The SVLC algorithm recurrently "glues" or synapses homogenous genetic subsequences together. This is done in such a way that common parental sequences are automatically preserved in the offspring with only the genetic differences being exchanged or removed, independent of the length of such differences. In a variable-length test problem, the SVLC algorithm compares favorably with current variable-length crossover techniques. The variable-length approach is further advocated by demonstrating how a variable-length genetic algorithm (GA) can obtain a high fitness solution in fewer iterations than a traditional fixed-length GA in a two-dimensional vector approximation task.

An LMS style variable tap-length algorithm for structure adaptation

Searching for the optimum tap-length that best balances the complexity and steady-state performance of an adaptive filter has attracted attention recently. Among existing algorithms that can be found in the literature, two of which, namely the segmented filter (SF) and gradient descent (GD) algorithms, are of particular interest as they can search for the optimum tap-length quickly. In this paper, at first, we carefully compare the SF and GD algorithms and show that the two algorithms are equivalent in performance under some constraints, but each has advantages/disadvantages relative to the other. Then, we propose an improved variable tap-length algorithm using the concept of the pseudo fractional tap-length (FT). Updating the tap-length with instantaneous errors in a style similar to that used in the stochastic gradient [or least mean squares (LMS)] algorithm, the proposed FT algorithm not only retains the advantages from both the SF and the GD algorithms but also has significantly less complexity than existing algorithms. Both performance analysis and numerical simulations are given to verify the new proposed algorithm.

Optimum decision delay of the finite-length DFE

This work investigates the optimum decision delay and tap-length of the finite-length decision feedback equalizer. First we show that, if the feedback filter (FBF) length Nb is equal to or larger than the channel memory v and the decision delay Δ is smaller than the feedforward filter (FFF) length Nf, then only the first Δ+1 elements of the FFF can be nonzero. Based on this result we prove that the maximum effective FBF length is equal to the channel memory v, and if Nb ≥ v and Nf is long enough, the optimum decision delay that minimizes the MMSE is Nf-1.