Monoclonal antibody screening of a phage-displayed random peptide library reveals mimotopes of chemokine receptor CCR5: Implications for the tertiary structure of the receptor and for an n-terminal binding site for HIV-1 gp120

The chemokine receptor CCR5 contains seven transmembrane-spanning domains. It binds chemokines and acts as co-receptor for macrophage (m)-tropic (or R5) strains of HIV-1. Monoclonal antibodies (mAb) to CCR5, 3A9 and 5C7, were used for biopanning a nonapeptide cysteine (C)-constrained phage-displayed random peptide library to ascertain contact residues and define tertiary structures of possible epitopes on CCR5. Reactivity of antibodies with phagotopes was established by enzyme-linked immunosorbent assay (ELISA). mAb 3A9 identified a phagotope C-HASIYDFGS-C (3A9/1), and 5C7 most frequently identified C-PHWLRDLRV-C (5C7/1). Corresponding peptides were synthesized. Phagotopes and synthetic peptides reacted in ELISA with corresponding antibodies and synthetic peptides inhibited antibody binding to the phagotopes. Reactivity by immunofluorescence of 3A9 with CCR5 was strongly inhibited by the corresponding peptide. Both mAb 3A9 and 5C7 reacted similarly with phagotopes and the corresponding peptide selected by the alternative mAb. The sequences of peptide inserts of phagotopes could be aligned as mimotopes of the sequence of CCR5. For phage 3A9/1, the motif SIYD aligned to residues at the N terminus and FG to residues on the first extracellular loop; for 5C7/1, residues at the N terminus, first extracellular loop, and possibly the third extracellular loop could be aligned and so would contribute to the mimotope. The synthetic peptides corresponding to the isolated phagotopes showed a CD4-dependent reactivity with gp120 of a primary, m-tropic HIV-1 isolate. Thus reactivity of antibodies raised to CCR5 against phage-displayed peptides defined mimotopes that reflect binding sites for these antibodies and reveal a part of the gp120 binding sites on CCR5.

Characterization of epitopes for virus-neutralizing monoclonal antibodies to Ross River virus E2 using phage-displayed random peptide libraries

Ross River virus (RRV) is the predominant cause of epidemic polyarthritis in Australia, yet the antigenic determinants are not well defined. We aimed to characterize epitope(s) on RRV-E2 for a panel of monoclonal antibodies (MAbs) that recognize overlapping conformational epitopes on the E2 envelope protein of RRV and that neutralize virus infection of cells in vitro. Phage-displayed random peptide libraries were probed with the MAbs T1E7, NB3C4, and T10C9 using solution-phase and solid-phase biopanning methods. The peptides VSIFPPA and KTAISPT were selected 15 and 6 times, respectively, by all three of the MAbs using solution-phase biopanning. The peptide LRLPPAP was selected 8 times by NB3C4 using solid-phase biopanning; this peptide shares a trio of amino acids with the peptide VSIFPPA. Phage that expressed the peptides VSIFPPA and LRLPPAP were reactive with T1E7 and/or NB3C4, and phage that expressed the peptides VSIFPPA, LRLPPAP, and KTAISPT partially inhibited the reactivity of T1E7 with RRV. The selected peptides resemble regions of RRV-E2 adjacent to sites mutated in neutralization escape variants of RRV derived by culture in the presence of these MAbs (E2 210-219 and 238-245) and an additional region of E2 172-182. Together these sites represent a conformational epitope of E2 that is informative of cellular contact sites on RRV.

Multiple alignment and sorting of peptides derived from phage-displayed random peptide libraries with polyclonal sera allows discrimination of relevant phagotopes

Biopanning of phage-displayed random peptide libraries is a powerful technique for identifying peptides that mimic epitopes (mimotopes) for monoclonal antibodies (mAbs). However, peptides derived using polyclonal antisera may represent epitopes for a diverse range of antibodies. Hence following screening of phage libraries with polyclonal antisera, including autoimmune disease sera, a procedure is required to distinguish relevant from irrelevant phagotopes. We therefore applied the multiple sequence alignment algorithm PILEUP together with a matrix for scoring amino acid substitutions based on physicochemical properties to generate guide trees depicting relatedness of selected peptides. A random heptapeptide library was biopanned nine times using no selecting antibodies, immunoglobulin G (IgG) from sera of subjects with autoimmune diseases (primary biliary cirrhosis (PBC) and type 1 diabetes) and three murine ascites fluids that contained mAbs to overlapping epitope(s) on the Ross River Virus envelope protein 2. Peptides randomly sampled from the library were distributed throughout the guide tree of the total set of peptides whilst many of the peptides derived in the absence of selecting antibody aligned to a single cluster. Moreover peptides selected by different sources of IgG aligned to separate clusters, each with a different amino acid motif. These alignments were validated by testing all of the 53 phagotopes derived using IgG from PBC sera for reactivity by capture ELISA with antibodies affinity purified on the E2 subunit of the pyruvate dehydrogenase complex (PDC-E2), the major autoantigen in PBC: only those phagotopes that aligned to PBC-associated clusters were reactive. Hence the multiple sequence alignment procedure discriminates relevant from irrelevant phagotopes and thus a major difficulty with biopanning phage-displayed random peptide libraries with polyclonal antibodies is surmounted.

Phagotopes derived by antibody screening of phage-displayed random peptide libraries vary in immunoreactivity: Studies using an exemplary monoclonal antibody, CII-C1, to type II collagen

Antibody screening of phage-displayed random peptide libraries to identify mimotopes of conformational epitopes is promising. However, because interpretations can be difficult, an exemplary system has been used in the present study to investigate whether variation in the peptide sequences of selected phagotopes corresponded with variation in immunoreactivity. The phagotopes, derived using a well-characterized monoclonal antibody, CII-C1, to a known conformational epitope on type II collagen, C1, were tested by direct and inhibition ELISA for reactivity with CII-C1. A multiple sequence alignment algorithm, PILEUP, was used to sort the peptides expressed by the phagotopes into clusters. A model was prepared of the C1 epitope on type II collagen. The 12 selected phagotopes reacted with CII-C1 by both direct ELISA (titres from < 100-11 200) and inhibition ELISA (20-100% inhibition); the reactivity varied according to the peptide sequence and assay format. The differences in reactivity between the phagotopes were mostly in accord with the alignment, by PILEUP, of the peptide sequences. The finding that the phagotopes functionally mimicked the C1 epitope on collagen was validated in that amino acids RRL at the amino terminal of many of the peptides were topographically demonstrable on the model of the C1 epitope. Notably, one phagotope that expressed the widely divergent peptide C-IAPKRHNSA-C also mimicked the C1 epitope, as judged by reactivity in each of the assays used: these included cross-inhibition of CII-C1 reactivity with each of the other phagotopes and inhibition by a synthetic peptide corresponding to that expressed by the most frequently selected phagotope, RRLPFGSQM. Thus, it has been demonstrated that multiple phage-displayed peptides can mimic the same epitope and that observed immunoreactivity of selected phagotopes with the selecting mAb can depend on the primary sequence of the expressed peptide and also on the assay format used.

Comparing multilevel and Bayesian spatial random effects survival models to assess geographical inequalities in colorectal cancer survival: a case study

Background Multilevel and spatial models are being increasingly used to obtain substantive information on area-level inequalities in cancer survival. Multilevel models assume independent geographical areas, whereas spatial models explicitly incorporate geographical correlation, often via a conditional autoregressive prior. However the relative merits of these methods for large population-based studies have not been explored. Using a case-study approach, we report on the implications of using multilevel and spatial survival models to study geographical inequalities in all-cause survival. Methods Multilevel discrete-time and Bayesian spatial survival models were used to study geographical inequalities in all-cause survival for a population-based colorectal cancer cohort of 22,727 cases aged 20–84 years diagnosed during 1997–2007 from Queensland, Australia. Results Both approaches were viable on this large dataset, and produced similar estimates of the fixed effects. After adding area-level covariates, the between-area variability in survival using multilevel discrete-time models was no longer significant. Spatial inequalities in survival were also markedly reduced after adjusting for aggregated area-level covariates. Only the multilevel approach however, provided an estimation of the contribution of geographical variation to the total variation in survival between individual patients. Conclusions With little difference observed between the two approaches in the estimation of fixed effects, multilevel models should be favored if there is a clear hierarchical data structure and measuring the independent impact of individual- and area-level effects on survival differences is of primary interest. Bayesian spatial analyses may be preferred if spatial correlation between areas is important and if the priority is to assess small-area variations in survival and map spatial patterns. Both approaches can be readily fitted to geographically enabled survival data from international settings

A directed continuous time random walk model with jump length depending on waiting time

In continuum one-dimensional space, a coupled directed continuous time random walk model is proposed, where the random walker jumps toward one direction and the waiting time between jumps affects the subsequent jump. In the proposed model, the Laplace-Laplace transform of the probability density function P(x,t) of finding the walker at position at time is completely determined by the Laplace transform of the probability density function φ(t) of the waiting time. In terms of the probability density function of the waiting time in the Laplace domain, the limit distribution of the random process and the corresponding evolving equations are derived.

Biomimicking natural nanopatterned topology by 3D laser lithography

Natural nanopatterned surfaces (nNPS) present on insect wings have demonstrated bactericidal activity [1, 2]. Fabricated nanopatterned surfaces (fNPS) derived by characterization of these wings have also shown superior bactericidal activity [2]. However bactericidal NPS topologies vary in both geometry and chemical characteristics of the individual features in different insects and fabricated surfaces, rendering it difficult to ascertain the optimum geometrical parameters underling bactericidal activity. This situation calls for the adaptation of new and emerging techniques, which are capable of fabricating and characterising comparable structures to nNPS from biocompatible materials. In this research, CAD drawn nNPS representing an area of 10 μm x10 μm was fabricated on a fused silica glass by Nanoscribe photonic professional GT 3D laser lithography system using two photon polymerization lithography. The glass was cleaned with acetone and isopropyl alcohol thrice and a drop of IP-DIP photoresist from Nanoscribe GmbH was cast onto the glass slide prior to patterning. Photosensitive IP-DIP resist was polymerized with high precision to make the surface nanopatterns using a 780 nm wavelength laser. Both moving-beam fixedsample (MBFS) and fixed-beam moving-sample (FBMS) fabrication approaches were tested during the fabrication process to determine the best approach for the precise fabrication of the required nanotopological pattern. Laser power was also optimized to fabricate the required fNPS, where this was changed from 3mW to 10mW to determine the optimum laser power for the polymerization of the photoresist for fabricating FNPS...

Orientational relaxation in a random dipolar lattice: Wave-number and frequency dependence

In order to understand the role of translational modes in the orientational relaxation in dense dipolar liquids, we have carried out a computer ''experiment'' where a random dipolar lattice was generated by quenching only the translational motion of the molecules of an equilibrated dipolar liquid. The lattice so generated was orientationally disordered and positionally random. The detailed study of orientational relaxation in this random dipolar lattice revealed interesting differences from those of the corresponding dipolar liquid. In particular, we found that the relaxation of the collective orientational correlation functions at the intermediate wave numbers was markedly slower at the long times for the random lattice than that of the liquid. This verified the important role of the translational modes in this regime, as predicted recently by the molecular theories. The single-particle orientational correlation functions of the random lattice also decayed significantly slowly at long times, compared to those of the dipolar liquid.

The reader-assembled narrative: Representing the random in print fiction

The growing interest in co-created reading experiences in both digital and print formats raises interesting questions for creative writers who work in the space of interactive fiction. This essay argues that writers have not abandoned experiments with co-creation in print narratives in favour of the attractions of the digital environment, as might be assumed by the discourse on digital development. Rather, interactive print narratives, in particular ‘reader-assembled narratives’ demonstrate a rich history of experimentation and continue to engage writers who wish to craft individual reading experiences for readers and to experiment with their own creative process as writers. The reader-assembled narrative has been used for many different reasons and for some writers, such as BS Johnson it is a method of problem solving, for others, like Robert Coover, it is a way to engage the reader in a more playful sense. Authors such as Marc Saporta, BS Johnson, and Robert Coover have engaged with this type of narrative play. This examination considers the narrative experimentation of these authors as a way of offering insights into creative practice for contemporary creative writers.

Stability of a Random Diffusion with Linear Drift

We consider a Linear system with Markovian switching which is perturbed by Gaussian type noise, If the linear system is mean square stable then we show that under certain conditions the perturbed system is also stable, We also shaw that under certain conditions the linear system with Markovian switching can be stabilized by such noisy perturbation.

A Global Constraint On Relative Rotation To Avoid Lumped Compliant Mechanisms In Topology Optimization

Some of the well known formulations for topology optimization of compliant mechanisms could lead to lumped compliant mechanisms. In lumped compliance, most of the elastic deformation in a mechanism occurs at few points, while rest of the mechanism remains more or less rigid. Such points are referred to as point-flexures. It has been noted in literature that high relative rotation is associated with point-flexures. In literature we also find a formulation of local constraint on relative rotations to avoid lumped compliance. However it is well known that a global constraint is easier to handle than a local constraint, by a numerical optimization algorithm. The current work presents a way of putting global constraint on relative rotations. This constraint is also simpler to implement since it uses linearized rotation at the center of finite-elements, to compute relative rotations. I show the results obtained by using this constraint oil the following benchmark problems - displacement inverter and gripper.

A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data

Background: A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from high-dimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN) from transcript profiling data. Results: The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l1-constrained fitting) problem and solved finally by formulating a Linear Program (LP). A bound on the Generalization Error of this approach is given in terms of the Leave-One-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM) initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known regulatory associations. In each S. cerevisiae LP-SLGN, the number of nodes with a particular degree follows an approximate power law suggesting that its degree distributions is similar to that observed in real-world networks. Inspection of these LP-SLGNs suggests biological hypotheses amenable to experimental verification. Conclusion: A statistically robust and computationally efficient LP-based method for estimating the topology of a large sparse undirected graph from high-dimensional data yields representations of genetic networks that are biologically plausible and useful abstractions of the structures of real genetic networks. Analysis of the statistical and topological properties of learned LP-SLGNs may have practical value; for example, genes with high random walk betweenness, a measure of the centrality of a node in a graph, are good candidates for intervention studies and hence integrated computational – experimental investigations designed to infer more realistic and sophisticated probabilistic directed graphical model representations of genetic networks. The LP-based solutions of the sparse linear regression problem described here may provide a method for learning the structure of transcription factor networks from transcript profiling and transcription factor binding motif data.

Speeding up AdaBoost Classifier with Random Projection

The development of techniques for scaling up classifiers so that they can be applied to problems with large datasets of training examples is one of the objectives of data mining. Recently, AdaBoost has become popular among machine learning community thanks to its promising results across a variety of applications. However, training AdaBoost on large datasets is a major problem, especially when the dimensionality of the data is very high. This paper discusses the effect of high dimensionality on the training process of AdaBoost. Two preprocessing options to reduce dimensionality, namely the principal component analysis and random projection are briefly examined. Random projection subject to a probabilistic length preserving transformation is explored further as a computationally light preprocessing step. The experimental results obtained demonstrate the effectiveness of the proposed training process for handling high dimensional large datasets.

Memory of past random wave conditions in submarine groundwater discharge

Submarine groundwater discharge (SGD) is an integral part of the hydrological cycle and represents an important aspect of land-ocean interactions. We used a numerical model to simulate flow and salt transport in a nearshore groundwater aquifer under varying wave conditions based on yearlong random wave data sets, including storm surge events. The results showed significant flow asymmetry with rapid response of influxes and retarded response of effluxes across the seabed to the irregular wave conditions. While a storm surge immediately intensified seawater influx to the aquifer, the subsequent return of intruded seawater to the sea, as part of an increased SGD, was gradual. Using functional data analysis, we revealed and quantified retarded, cumulative effects of past wave conditions on SGD including the fresh groundwater and recirculating seawater discharge components. The retardation was characterized well by a gamma distribution function regardless of wave conditions. The relationships between discharge rates and wave parameters were quantifiable by a regression model in a functional form independent of the actual irregular wave conditions. This statistical model provides a useful method for analyzing and predicting SGD from nearshore unconfined aquifers affected by random waves

Topology-Guided Tessellation Of Quadratic Elements

Topology-based methods have been successfully used for the analysis and visualization of piecewise-linear functions defined on triangle meshes. This paper describes a mechanism for extending these methods to piecewise-quadratic functions defined on triangulations of surfaces. Each triangular patch is tessellated into monotone regions, so that existing algorithms for computing topological representations of piecewise-linear functions may be applied directly to the piecewise-quadratic function. In particular, the tessellation is used for computing the Reeb graph, a topological data structure that provides a succinct representation of level sets of the function.