Promoter Prediction with a GP-Automaton

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

  author =       "Daniel Howard and Karl Benson",
  title =        "Promoter Prediction with a {GP}-Automaton",
  booktitle =    "Applications of Evolutionary Computing,
                 EvoWorkshops2003: Evo{BIO}, Evo{COP}, Evo{IASP},
                 Evo{MUSART}, Evo{ROB}, Evo{STIM}",
  year =         "2003",
  editor =       "G{\"u}nther R. Raidl and Stefano Cagnoni and 
                 Juan Jes\'us Romero Cardalda and David W. Corne and 
                 Jens Gottlieb and Agn\`es Guillot and Emma Hart and 
                 Colin G. Johnson and Elena Marchiori and Jean-Arcady Meyer and 
                 Martin Middendorf",
  volume =       "2611",
  series =       "LNCS",
  pages =        "44--53",
  address =      "University of Essex, England, UK",
  publisher_address = "Berlin",
  month =        "14-16 " # apr,
  organisation = "EvoNet",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming, evolutionary
                 computation, applications",
  isbn13 =       "978-3-540-00976-4",
  DOI =          "doi:10.1007/3-540-36605-9_5",
  abstract =     "A GP-automaton evolves motif sequences for its states;
                 it moves the point of motif application at transition
                 time using an integer that is stored and evolved in the
                 transition; and it combines motif matches via logical
                 functions that it also stores and evolves in each
                 transition. This scheme learns to predict promoters in
                 human genome. The experiments reported use 5-fold cross
  notes =        "EvoWorkshops2003",

Genetic Programming entries for Daniel Howard Karl A Benson