Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization

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

@Article{Moilanen:1999:C,
  author =       "Atte Moilanen",
  title =        "Searching for Most Parsimonious Trees with Simulated
                 Evolutionary Optimization",
  journal =      "Cladistics",
  year =         "1999",
  volume =       "15",
  pages =        "39--50",
  number =       "1",
  owner =        "wlangdon",
  keywords =     "genetic algorithms, genetic programming, most
                 parsimonious tree, evolutionary optimisation, parsimony
                 computer program",
  URL =          "http://www.helsinki.fi/~ihanski/Articles_by_others/Cladistics%201999%20Moilanen.pdf",
  URL =          "http://www.sciencedirect.com/science/article/B6WCG-45K1GFT-C/2/26d8ad738876c47be070b90929205273",
  DOI =          "doi:10.1006/clad.1998.0081",
  abstract =     "This study describes novel algorithms for searching
                 for most parsimonious trees. These algorithms are
                 implemented as a parsimony computer program, PARSIGAL,
                 which performs well even with difficult data sets. For
                 high level search, PARSIGAL uses an evolutionary
                 optimisation algorithm, which feeds good tree
                 candidates to a branch-swapping local search procedure.
                 This study also describes an extremely fast method of
                 recomputing state sets for binary characters (additive
                 or nonadditive characters with two states), based on
                 packing 32 characters into a single memory word and
                 recomputing the tree simultaneously for all 32
                 characters using fast bitwise logical operations. The
                 operational principles of PARSIGAL are quite different
                 from those previously published for other parsimony
                 computer programs. Hence it is conceivable that
                 PARSIGAL may be able to locate islands of trees that
                 are different from those that are easily located with
                 existing parsimony computer programs.",
}

Genetic Programming entries for Atte Moilanen

Citations