Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

Optimising profitability and environmental trade-offs in managing cropping systems using differential evolution

Whilst traditional optimisation techniques based on mathematical programming techniques are in common use, they suffer from their inability to explore the complexity of decision problems addressed using agricultural system models. In these models, the full decision space is usually very large while the solution space is characterized by many local optima. Methods to search such large decision spaces rely on effective sampling of the problem domain. Nevertheless, problem reduction based on insight into agronomic relations and farming practice is necessary to safeguard computational feasibility. Here, we present a global search approach based on an Evolutionary Algorithm (EA). We introduce a multi-objective evaluation technique within this EA framework, linking the optimisation procedure to the APSIM cropping systems model. The approach addresses the issue of system management when faced with a trade-off between economic and ecological consequences.

Robust parameter settings of evolutionary algorithms for the optimisation of agricultural systems models

Numerical optimisation methods are being more commonly applied to agricultural systems models, to identify the most profitable management strategies. The available optimisation algorithms are reviewed and compared, with literature and our studies identifying evolutionary algorithms (including genetic algorithms) as superior in this regard to simulated annealing, tabu search, hill-climbing, and direct-search methods. Results of a complex beef property optimisation, using a real-value genetic algorithm, are presented. The relative contributions of the range of operational options and parameters of this method are discussed, and general recommendations listed to assist practitioners applying evolutionary algorithms to the solution of agricultural systems. (C) 2001 Elsevier Science Ltd. All rights reserved.

Causality detection on US mutual fund movements using evolutionary subset time-series

In this paper we develop an evolutionary kernel-based time update algorithm to recursively estimate subset discrete lag models (including fullorder models) with a forgetting factor and a constant term, using the exactwindowed case. The algorithm applies to causality detection when the true relationship occurs with a continuous or a random delay. We then demonstrate the use of the proposed evolutionary algorithm to study the monthly mutual fund data, which come from the 'CRSP Survivor-bias free US Mutual Fund Database'. The results show that the NAV is an influential player on the international stage of global bond and stock markets.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Searching oligo sets of human chromosome 12 using evolutionary strategies

DNA Microarray is a powerful tool to measure the level of a mixed population of nucleic acids at one time, which has great impact in many aspects of life sciences research. In order to distinguish nucleic acids with very similar composition by hybridization, it is necessary to design microarray probes with high specificities and sensitivities. Highly specific probes correspond to probes having unique DNA sequences; whereas highly sensitive probes correspond to those with melting temperature within a desired range and having no secondary structure. The selection of these probes from a set of functional DNA sequences (exons) constitutes a computationally expensive discrete non-linear search problem. We delegate the search task to a simple yet effective Evolution Strategy algorithm. The computational efficiency is also greatly improved by making use of an available bioinformatics tool.

The interaction between technologies and society: Lessons learnt from 160 evolutionary years of online news services

In mapping the evolutionary process of online news and the socio-cultural factors determining this development, this paper has a dual purpose. First, in reworking the definition of “online communication”, it argues that despite its seemingly sudden emergence in the 1990s, the history of online news started right in the early days of the telegraphs and spread throughout the development of the telephone and the fax machine before becoming computer-based in the 1980s and Web-based in the 1990s. Second, merging macro-perspectives on the dynamic of media evolution by DeFleur and Ball-Rokeach (1989) and Winston (1998), the paper consolidates a critical point for thinking about new media development: that something technically feasible does not always mean that it will be socially accepted and/or demanded. From a producer-centric perspective, the birth and development of pre-Web online news forms have been more or less generated by the traditional media’s sometimes excessive hype about the power of new technologies. However, placing such an emphasis on technological potentials at the expense of their social conditions not only can be misleading but also can be detrimental to the development of new media, including the potential of today’s online news.

Sampling phylogenetic tree space with the generalized Gibbs sampler

The generalized Gibbs sampler (GGS) is a recently developed Markov chain Monte Carlo (MCMC) technique that enables Gibbs-like sampling of state spaces that lack a convenient representation in terms of a fixed coordinate system. This paper describes a new sampler, called the tree sampler, which uses the GGS to sample from a state space consisting of phylogenetic trees. The tree sampler is useful for a wide range of phylogenetic applications, including Bayesian, maximum likelihood, and maximum parsimony methods. A fast new algorithm to search for a maximum parsimony phylogeny is presented, using the tree sampler in the context of simulated annealing. The mathematics underlying the algorithm is explained and its time complexity is analyzed. The method is tested on two large data sets consisting of 123 sequences and 500 sequences, respectively. The new algorithm is shown to compare very favorably in terms of speed and accuracy to the program DNAPARS from the PHYLIP package.

An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Evolutionary distinctiveness and status of the endangered Lake Eacham rainbowfish (Melanotaenia eachamensis)

The Lake Eacham rainbowfish (Melanotaenia eachamensis) was declared extinct in the wild in the late 1980s after it disappeared from its only known locality, an isolated crater lake in northeast Queensland. Doubts have been raised about whether this taxon is distinct from surrounding populations of the eastern rainbowfish (Melanotaenia splendida splendida). We examined the evolutionary distinctiveness of M. eachamensis, obtained from captive stocks, relative to M. s. splendida through analysis of variation in mtDNA sequences, nuclear microsatellites, and morphometric characters Captive M. eachamensis had mtDNAs that were highly divergent from those in most populations of M. s. splendida. A broader geographic survey using RFLPs revealed some populations initially identified as M. s. splendida, that carried eachamensis mtDNA, whereas some others had mixtures of eachamensis and splendida mtDNA. The presence of eachamensis-like mtDNA in these populations could in principle be due to (1) sorting of ancestral polymorphisms, (2) introgression of M. eachamensis mtDNA into M. s. splendida, or (3) incorrect species boundaries, such that some populations currently assigned to M. s. splendida are M. eachamensis or are mixtures of the two species. These alternatives hypotheses were evaluated through comparisons of four nuclear microsatellite loci and morphometrics and meristics. In analyses of both data sets, populations of M. s. splendida with eachamensis mtDNA were more similar to captive M. eachamensis than to M. s. splendida with splendida mtDNA, supporting hypothesis 3. These results are significant for the management of M. eachamensis in several respects. First the combined molecular and morphological evidence indicates that M. eachamensis is a distinct species and a discrete evolutionarily significant unit worthy of conservation effort. Second it appears that the species boundary between M. eachamensis and M. s. splendida has been misdiagnosed such that there are extant populations on the Atherton Tableland as well as areas where both forms coexist. Accordingly we suggest that M. eachamensis be listed as vulnerable, rather than critical (or extinct in the wild). Third, the discovery of extant but genetically divergent populations of M. eachamensis on the Atherton Tableland broadens the options for future reintroductions to Lake Eacham.

Studies of evolutionary temperature adaptation: Muscle function and locomotor performance in Antarctic fish

1, Studies of evolutionary temperature adaptation of muscle and locomotor performance in fish are reviewed with a focus on the Antarctic fauna living at subzero temperatures. 2. Only limited data are available to compare the sustained and burst swimming kinematics and performance of Antarctic, temperate and tropical species. Available data indicate that low temperatures limit maximum swimming performance and this is especially evident in fish larvae. 3, In a recent study, muscle performance in the Antarctic rock cod Notothenia coriiceps at 0 degrees C was found to be sufficient to produce maximum velocities during burst swimming that were similar to those seen in the sculpin Myoxocephalus scorpius at 10 degrees C, indicating temperature compensation of muscle and locomotor performance in the Antarctic fish. However, at 15 degrees C, sculpin produce maximum swimming velocities greater than N, coriiceps at 0 degrees C, 4, It is recommended that strict hypothesis-driven investigations using ecologically relevant measures of performance are undertaken to study temperature adaptation in Antarctic fish, Recent detailed phylogenetic analyses of the Antarctic fish fauna and their temperate relatives will allow a stronger experimental approach by helping to separate what is due to adaptation to the cold and what is due to phylogeny alone.