The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
Classification of microarray data requires the selection of a subset of relevant genes in order to achieve good classification performance. Several genetic algorithms have been d...