Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
We introduce fitnessless coevolution (FC), a novel method of comparative one-population coevolution. FC plays games between individuals to settle tournaments in the selection pha...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...