Bridging Elementary Landscapes and a Geometric Theory of Evolutionary Algorithms: First Steps

This is the author accepted manuscript. The final version is available from Springer via the DOI in this record.Paper to be presented at the Fifteenth International Conference on Parallel Problem Solving from Nature (PPSN XV), Coimbra, Portugal on 8-12 September.Based on a geometric theory of evolutionary algorithms, it was shown that all evolutionary algorithms equipped with a geometric crossover and no mutation operator do the same kind of convex search across representations, and that they are well matched with generalised forms of concave fitness landscapes for which they provably find the optimum in polynomial time. Analysing the landscape structure is essential to understand the relationship between problems and evolutionary algorithms. This paper continues such investigations by considering the following challenge: develop an analytical method to recognise that the fitness landscape for a given problem provably belongs to a class of concave fitness landscapes. Elementary landscapes theory provides analytic algebraic means to study the landscapes structure. This work begins linking both theories to better understand how such method could be devised using elementary landscapes. Examples on well known One Max, Leading Ones, Not-All-Equal Satisfiability and Weight Partitioning problems illustrate the fundamental concepts supporting this approach

A Unifying View on Recombination Spaces and Abstract Convex Evolutionary Search

This is the author accepted manuscript. The final version is available from Springer via the DOI in this record.Proceedings of EvoCOP 2019 - 19th European Conference on Evolutionary Computation, 24-26 April 2019, Leipzig, GermanyPrevious work proposed to unify an algebraic theory of fitness landscapes and a geometric framework of evolutionary algorithms (EAs). One of the main goals behind this unification is to develop an analytical method that verifies if a problem's landscape belongs to certain abstract convex landscapes classes, where certain recombination-based EAs (without mutation) have polynomial runtime performance. This paper advances such unification by showing that: (a) crossovers can be formally classified according to geometric or algebraic axiomatic properties; and (b) the population behaviour induced by certain crossovers in recombination-based EAs can be formalised in the geometric and algebraic theories. These results make a significant contribution to the basis of an integrated geometric-algebraic framework with which analyse recombination spaces and recombination-based EAs

Evolutionary Games with Affine Fitness Functions: Applications to Cancer

We analyze the dynamics of evolutionary games in which fitness is defined as an affine function of the expected payoff and a constant contribution. The resulting inhomogeneous replicator equation has an homogeneous equivalent with modified payoffs. The affine terms also influence the stochastic dynamics of a two-strategy Moran model of a finite population. We then apply the affine fitness function in a model for tumor-normal cell interactions to determine which are the most successful tumor strategies. In order to analyze the dynamics of concurrent strategies within a tumor population, we extend the model to a three-strategy game involving distinct tumor cell types as well as normal cells. In this model, interaction with normal cells, in combination with an increased constant fitness, is the most effective way of establishing a population of tumor cells in normal tissue.Comment: The final publication is available at http://www.springerlink.com, http://dx.doi.org/10.1007/s13235-011-0029-

On RAF Sets and Autocatalytic Cycles in Random Reaction Networks

The emergence of autocatalytic sets of molecules seems to have played an important role in the origin of life context. Although the possibility to reproduce this emergence in laboratory has received considerable attention, this is still far from being achieved. In order to unravel some key properties enabling the emergence of structures potentially able to sustain their own existence and growth, in this work we investigate the probability to observe them in ensembles of random catalytic reaction networks characterized by different structural properties. From the point of view of network topology, an autocatalytic set have been defined either in term of strongly connected components (SCCs) or as reflexively autocatalytic and food-generated sets (RAFs). We observe that the average level of catalysis differently affects the probability to observe a SCC or a RAF, highlighting the existence of a region where the former can be observed, whereas the latter cannot. This parameter also affects the composition of the RAF, which can be further characterized into linear structures, autocatalysis or SCCs. Interestingly, we show that the different network topology (uniform as opposed to power-law catalysis systems) does not have a significantly divergent impact on SCCs and RAFs appearance, whereas the proportion between cleavages and condensations seems instead to play a role. A major factor that limits the probability of RAF appearance and that may explain some of the difficulties encountered in laboratory seems to be the presence of molecules which can accumulate without being substrate or catalyst of any reaction.Comment: pp 113-12

International Veterinary Epilepsy Task Force recommendations for a veterinary epilepsy-specific MRI protocol

Epilepsy is one of the most common chronic neurological diseases in veterinary practice. Magnetic resonance imaging (MRI) is regarded as an important diagnostic test to reach the diagnosis of idiopathic epilepsy. However, given that the diagnosis requires the exclusion of other differentials for seizures, the parameters for MRI examination should allow the detection of subtle lesions which may not be obvious with existing techniques. In addition, there are several differentials for idiopathic epilepsy in humans, for example some focal cortical dysplasias, which may only apparent with special sequences, imaging planes and/or particular techniques used in performing the MRI scan. As a result, there is a need to standardize MRI examination in veterinary patients with techniques that reliably diagnose subtle lesions, identify post-seizure changes, and which will allow for future identification of underlying causes of seizures not yet apparent in the veterinary literature. There is a need for a standardized veterinary epilepsy-specific MRI protocol which will facilitate more detailed examination of areas susceptible to generating and perpetuating seizures, is cost efficient, simple to perform and can be adapted for both low and high field scanners. Standardisation of imaging will improve clinical communication and uniformity of case definition between research studies. A 6–7 sequence epilepsy-specific MRI protocol for veterinary patients is proposed and further advanced MR and functional imaging is reviewed

Best match graphs

Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let T be a phylogenetic (gene) tree T and σ an assignment of leaves of T to species. The best match graph (G,σ) is a digraph that contains an arc from x to y if the genes x and y reside in different species and y is one of possibly many (evolutionary) closest relatives of x compared to all other genes contained in the species σ(y). Here, we characterize best match graphs and show that it can be decided in cubic time and quadratic space whether (G,σ) derived from a tree in this manner. If the answer is affirmative, there is a unique least resolved tree that explains (G,σ), which can also be constructed in cubic time

Boolean Dynamics with Random Couplings

This paper reviews a class of generic dissipative dynamical systems called N-K models. In these models, the dynamics of N elements, defined as Boolean variables, develop step by step, clocked by a discrete time variable. Each of the N Boolean elements at a given time is given a value which depends upon K elements in the previous time step. We review the work of many authors on the behavior of the models, looking particularly at the structure and lengths of their cycles, the sizes of their basins of attraction, and the flow of information through the systems. In the limit of infinite N, there is a phase transition between a chaotic and an ordered phase, with a critical phase in between. We argue that the behavior of this system depends significantly on the topology of the network connections. If the elements are placed upon a lattice with dimension d, the system shows correlations related to the standard percolation or directed percolation phase transition on such a lattice. On the other hand, a very different behavior is seen in the Kauffman net in which all spins are equally likely to be coupled to a given spin. In this situation, coupling loops are mostly suppressed, and the behavior of the system is much more like that of a mean field theory. We also describe possible applications of the models to, for example, genetic networks, cell differentiation, evolution, democracy in social systems and neural networks.Comment: 69 pages, 16 figures, Submitted to Springer Applied Mathematical Sciences Serie

From pairs of most similar sequences to phylogenetic best matches

Background Many of the commonly used methods for orthology detection start from mutually most similar pairs of genes (reciprocal best hits) as an approximation for evolutionary most closely related pairs of genes (reciprocal best matches). This approximation of best matches by best hits becomes exact for ultrametric dissimilarities, i.e., under the Molecular Clock Hypothesis. It fails, however, whenever there are large lineage specific rate variations among paralogous genes. In practice, this introduces a high level of noise into the input data for best-hit-based orthology detection methods. Results If additive distances between genes are known, then evolutionary most closely related pairs can be identified by considering certain quartets of genes provided that in each quartet the outgroup relative to the remaining three genes is known. A priori knowledge of underlying species phylogeny greatly facilitates the identification of the required outgroup. Although the workflow remains a heuristic since the correct outgroup cannot be determined reliably in all cases, simulations with lineage specific biases and rate asymmetries show that nearly perfect results can be achieved. In a realistic setting, where distances data have to be estimated from sequence data and hence are noisy, it is still possible to obtain highly accurate sets of best matches. Conclusion Improvements of tree-free orthology assessment methods can be expected from a combination of the accurate inference of best matches reported here and recent mathematical advances in the understanding of (reciprocal) best match graphs and orthology relations. Availability Accompanying software is available at https://github.com/david-schaller/AsymmeTree

Hagfish and lamprey Hox genes reveal conservation of temporal colinearity in vertebrates

Hox genes exert fundamental roles for proper regional specification along the main rostro-caudal axis of animal embryos. They are generally expressed in restricted spatial domains according to their position in the cluster (spatial colinearity)—a feature that is conserved across bilaterians. In jawed vertebrates (gnathostomes), the position in the cluster also determines the onset of expression of Hox genes (a feature known as whole-cluster temporal colinearity (WTC)), while in invertebrates this phenomenon is displayed as a subcluster-level temporal colinearity. However, little is known about the expression profile of Hox genes in jawless vertebrates (cyclostomes); therefore, the evolutionary origin of WTC, as seen in gnathostomes, remains a mystery. Here, we show that Hox genes in cyclostomes are expressed according to WTC during development. We investigated the Hox repertoire and Hox gene expression profiles in three different species—a hagfish, a lamprey and a shark—encompassing the two major groups of vertebrates, and found that these are expressed following a whole-cluster, temporally staggered pattern, indicating that WTC has been conserved during the past 500 million years despite drastically different genome evolution and morphological outputs between jawless and jawed vertebrates

The reality of pervasive transcription.

International audienc