Computational methods for prediction of T-cell epitopes - a framework for modelling, testing, and applications

Computational models complement laboratory experimentation for efficient identification of MHC-binding peptides and T-cell epitopes. Methods for prediction of MHC-binding peptides include binding motifs, quantitative matrices, artificial neural networks, hidden Markov models, and molecular modelling. Models derived by these methods have been successfully used for prediction of T-cell epitopes in cancer, autoimmunity, infectious disease, and allergy. For maximum benefit, the use of computer models must be treated as experiments analogous to standard laboratory procedures and performed according to strict standards. This requires careful selection of data for model building, and adequate testing and validation. A range of web-based databases and MHC-binding prediction programs are available. Although some available prediction programs for particular MHC alleles have reasonable accuracy, there is no guarantee that all models produce good quality predictions. In this article, we present and discuss a framework for modelling, testing, and applications of computational methods used in predictions of T-cell epitopes. (C) 2004 Elsevier Inc. All rights reserved.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.

Evaluation of computational methods for the reconstruction of HLA haplotypes

Human leukocyte antigen (HLA) haplotypes are frequently evaluated for population history inferences and association studies. However, the available typing techniques for the main HLA loci usually do not allow the determination of the allele phase and the constitution of a haplotype, which may be obtained by a very time-consuming and expensive family-based segregation study. Without the family-based study, computational inference by probabilistic models is necessary to obtain haplotypes. Several authors have used the expectation-maximization (EM) algorithm to determine HLA haplotypes, but high levels of erroneous inferences are expected because of the genetic distance among the main HLA loci and the presence of several recombination hotspots. In order to evaluate the efficiency of computational inference methods, 763 unrelated individuals stratified into three different datasets had their haplotypes manually defined in a family-based study of HLA-A, -B, -DRB1 and -DQB1 segregation, and these haplotypes were compared with the data obtained by the following three methods: the Expectation-Maximization (EM) and Excoffier-Laval-Balding (ELB) algorithms using the arlequin 3.11 software, and the PHASE method. When comparing the methods, we observed that all algorithms showed a poor performance for haplotype reconstruction with distant loci, estimating incorrect haplotypes for 38%-57% of the samples considering all algorithms and datasets. We suggest that computational haplotype inferences involving low-resolution HLA-A, HLA-B, HLA-DRB1 and HLA-DQB1 haplotypes should be considered with caution.

Lexical decision in Parkinson's disease: A reply to Brown, McDonald, and Spicer (1999)

Recent semantic priming investigations in Parkinsons disease (PD) employed variants of Neelys (1977) lexical decision paradigm to dissociate the automatic and attentional aspects of semantic activation (McDonald, Brown, Gorell, 1996; Spicer, Brown, Gorell, 1994). In our earlier review, we claimed that the results of Spicer, McDonald and colleagues normal control participants violated the two-process model of information processing (Posner Snyder, 1975) upon which their experimental paradigm had been based (Arnott Chenery, 1999). We argued that, even at the shortest SOA employed, key design modifications to Neelys original experiments biased the tasks employed by Spicer et al. and McDonald et al. towards being assessments of attention-dependent processes. Accordingly, we contended that experimental procedures did not speak to issues of automaticity and, therefore, Spicer, McDonald and colleagues claims of robust automatic semantic activation in PD must be treated with caution.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.

An on-line investigation of lexical ambiguity processing in schizophrenia

The processing of lexical ambiguity in context was investigated in eight individuals with schizophrenia and a matched control group. Participants made speeded lexical decisions on the third word in auditory word triplets representing concordant (coin-bank-money), discordant (river-bank-money). neutral (day-bank-money), and unrelated (river-day-money) conditions. When the interstimulus interval (ISI) between the words was 100 ms. individuals with schizophrenia demonstrated priming consistent with selective. context-based lexical activation. At 1250 ms ISI a pattern of nonselective meaning facilitation was obtained. These results suggest an attentional breakdown in the sustained inhibition of meanings on the basis of lexical context. (C) 2002 Elsevier Science (USA).

Computational differentiation of N-terminal signal peptides and transmembrane helices

Signal peptides and transmembrane helices both contain a stretch of hydrophobic amino acids. This common feature makes it difficult for signal peptide and transmembrane helix predictors to correctly assign identity to stretches of hydrophobic residues near the N-terminal methionine of a protein sequence. The inability to reliably distinguish between N-terminal transmembrane helix and signal peptide is an error with serious consequences for the prediction of protein secretory status or transmembrane topology. In this study, we report a new method for differentiating protein N-terminal signal peptides and transmembrane helices. Based on the sequence features extracted from hydrophobic regions (amino acid frequency, hydrophobicity, and the start position), we set up discriminant functions and examined them on non-redundant datasets with jackknife tests. This method can incorporate other signal peptide prediction methods and achieve higher prediction accuracy. For Gram-negative bacterial proteins, 95.7% of N-terminal signal peptides and transmembrane helices can be correctly predicted (coefficient 0.90). Given a sensitivity of 90%, transmembrane helices can be identified from signal peptides with a precision of 99% (coefficient 0.92). For eukaryotic proteins, 94.2% of N-terminal signal peptides and transmembrane helices can be correctly predicted with coefficient 0.83. Given a sensitivity of 90%, transmembrane helices can be identified from signal peptides with a precision of 87% (coefficient 0.85). The method can be used to complement current transmembrane protein prediction and signal peptide prediction methods to improve their prediction accuracies. (C) 2003 Elsevier Inc. All rights reserved.

Thermomechanical environment characterisation in injection moulding and its relation to the mechanical properties of talc-filled polypropylene

This study is focused on the establishment of relationships between the injection moulding processing conditions, the applied thermomechanical environment (TME) and the tensile properties of talc-filled polypropylene,adopting a new extended concept of thermomechanical indices (TMI). In this approach, TMI are calculated from computational simulations of the moulding process that characterise the TME during processing, which are then related to the mechanical properties of the mouldings. In this study, this concept is extended to both the filling and the packing phases, with new TMI defined related to the morphology developed during these phases. A design of experiments approach based on Taguchi orthogonal arrays was adopted to vary the injection moulding parameters (injection flow rate, injection temperature, mould wall temperature and holding pressure), and thus, the TME. Results from analysis of variance for injection-moulded tensile specimens have shown that among the considered processing conditions, the flow rate is the most significant parameter for the Young’s modulus; the flow rate and melt temperature are the most significant for the strain at break; and the holding pressure and flow rate are the most significant for the stress at yield. The yield stress and Young’s modulus were found to be governed mostly by the thermostress index (TSI, related to the orientation of the skin layer), whilst the strain at break depends on both the TSI and the cooling index (CI, associated to the crystallinity degree of the core region). The proposed TMI approach provides predictive capabilities of the mechanical response of injection-moulded components, which is a valuable input during their design stage.

Critical behavior of a three-dimensional hardcore-cylinder composite system

In this work the critical indices β, γ , and ν for a three-dimensional (3D) hardcore cylinder composite system with short-range interaction have been obtained. In contrast to the 2D stick system and the 3D hardcore cylinder system, the determined critical exponents do not belong to the same universality class as the lattice percolation,although they obey the common hyperscaling relation for a 3D system. It is observed that the value of the correlation length exponent is compatible with the predictions of the mean field theory. It is also shown that, by using the Alexander-Orbach conjuncture, the relation between the conductivity and the correlation length critical exponents has a typical value for a 3D lattice system.