Inferring Phylogenetic Trees Using Evolutionary Algorithms

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

@InProceedings{cotta:ppsn2002:pp720,
  author =       "Carlos Cotta and Pablo Moscato",
  title =        "Inferring Phylogenetic Trees Using Evolutionary
                 Algorithms",
  booktitle =    "Parallel Problem Solving from Nature - PPSN VII",
  address =      "Granada, Spain",
  month =        "7-11 " # sep,
  pages =        "720--729",
  year =         "2002",
  editor =       "Juan J. Merelo-Guervos and Panagiotis Adamidis and 
                 Hans-Georg Beyer and Jose-Luis Fernandez-Villacanas and 
                 Hans-Paul Schwefel",
  number =       "2439",
  series =       "Lecture Notes in Computer Science, LNCS",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming, Biology and
                 chemistry, Comparisons of representations",
  ISBN =         "3-540-44139-5",
  ISBN =         "3-540-44139-5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2439&spage=720",
  DOI =          "doi:10.1007/3-540-45712-7_69",
  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 100percent success at a lower
                 computational cost than the remaining approaches.",
}

Genetic Programming entries for Carlos Cotta Pablo Moscato

Citations