Parallel Implementation of Genetic Algorithms for Phylogenetics

POL, D.

Columbus, Ohio, EEUU

Workshop; First Young Researchers Workshop in Mathematical Biology; 2005

Mathematical Biosciences Institute

Genetic algorithms have been increasingly used in phylogenetics during the last ten years to find the optimal phylogenetic tree/s from the space of all possible leaf-labeled topologies. This combinatorial optimization problem (phylogenetic tree search) is compute bound and must be approached through heuristics for large and biologically interesting datasets. Results on parallel implementations of genetic algorithms are presented here for the analysis of datasets with large number of species (between several hundreds and several thousands) using Beowulf clusters.Ver PDF adjunto y disponible en: http://www.mbi.osu.edu/2004/wspostabstracts.html