%0 Conference Paper %1 cotta:ppsn2002:pp720 %A Cotta, Carlos %A Moscato, Pablo %B Parallel Problem Solving from Nature - PPSN VII %C Granada, Spain %D 2002 %E Merelo-Guervos, Juan J. %E Adamidis, Panagiotis %E Beyer, Hans-Georg %E Fernandez-Villacanas, Jose-Luis %E Schwefel, Hans-Paul %I Springer-Verlag %K Biology Comparisons algorithms, and chemistry, genetic of programming, representations %N 2439 %P 720--729 %T Inferring Phylogenetic Trees Using Evolutionary Algorithms %U http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2439&spage=720 %X 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. %Z Available from http://link.springer.de/link/service/series/0558/papers/2439/243900720.pdf %@ 3-540-44139-5

@inproceedings{cotta:ppsn2002:pp720, 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.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Granada, Spain}, annote = {Available from http://link.springer.de/link/service/series/0558/papers/2439/243900720.pdf}, author = {Cotta, Carlos and Moscato, Pablo}, biburl = {https://www.bibsonomy.org/bibtex/2f764e45dd75044aa47624b7e1239440d/brazovayeye}, booktitle = {Parallel Problem Solving from Nature - PPSN VII}, editor = {Merelo-Guervos, Juan J. and Adamidis, Panagiotis and Beyer, Hans-Georg and Fernandez-Villacanas, Jose-Luis and Schwefel, Hans-Paul}, interhash = {76361eefdaf8eec026b7e050b8267fdb}, intrahash = {f764e45dd75044aa47624b7e1239440d}, isbn = {3-540-44139-5}, keywords = {Biology Comparisons algorithms, and chemistry, genetic of programming, representations}, month = {7-11 September}, number = 2439, pages = {720--729}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science, LNCS}, timestamp = {2008-06-19T17:38:11.000+0200}, title = {Inferring Phylogenetic Trees Using Evolutionary Algorithms}, url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2439&spage=720}, year = 2002 }