Inferring Phylogenetic Trees Using Evolutionary Algorithms
|
C. Cotta, P. Moscato Parallel Problem Solving From Nature VII, J.J. Merelo et al. (eds.), Lecture Notes in Computer Science 2439, pp. 720-729, Springer-Verlag Berlin, 2002 © Springer-Verlag Berlin Heidelberg 2002. All rights reserved. |
|
Abstract
|
We consider the problem of estimating the evolutionary history of a collection of organisms in terms of a phylogenetic tree. This is a hard combinatorial optimization problem for which different EA approaches are proposed and evaluated. Using two problem instances of different sizes, it is shown that an EA that directly encodes trees and uses ad-hoc operators performs better than several decoder-based EAs, but does not scale well with the problem size. A greedy-decoder EA provides the overall best results, achieving near 100%-success at a lower computational cost than the remaining approaches. | |
|
 |
|
Download BibTEX entry | |
|
 |
|
Download PDF version (191K) | |
[Back to publications page].