Promoter Prediction with a GP-Automaton
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 validation.
KeywordsFinite State Automaton Promoter Prediction Halt State Bacterial Promoter Finite State Automaton
Unable to display preview. Download preview PDF.
- [Ashlock, 1997]Ashlock, D. (1997). GP-Automata for dividing the dollar. In Koza et. al. (Eds) Genetic Programming: Proceedings of the Second Annual Conference, 18–26, Stanford University.Google Scholar
- [Benson, 2000a]Benson, K. A. (2000). Evolving Finite State Machines with Embedded Genetic Programming for Automatic Target Detection within SAR Imagery In Proceedings of the Congress on Evolutionary Computation, 1543–1549, La Jolla, San Diego, USA.Google Scholar
- [Benson, 2000b]Benson, K. A. (2000). Performing Automatic Target Detection with evolvable finite state automata. In Journal of Image and Vision Computing, Volume 20, Issue 9–10, Elsevier.Google Scholar
- [Cattaneo et. al., 2002]Cattaneo E., Rigamonti D., Zuccato C. The Enigma of Huntington’s Disease. Scientific American, December 2002.Google Scholar
- [Hannenhalli and Levy, 2001]Hannenhalli S. and Levy S. (2001). Promoter prediction in the human genome. In Proceedings of the 9th International Conference on Intelligent Systems for Molecular Biology. Copenhagen, Denmark, July 21-25, 2001, Bioinformatics, Vol 17, Supplement 1, pp. S90–S96. ISSN: 1367-4803.Google Scholar
- [Koza, 1999]John R. Koza (1999). Genetic Programming III: Darwinian Invention and Problem Solving, MIT Press.Google Scholar
- [Lewin, 2000]Benjamin Lewin (2000). Genes VII, Oxford University Press.Google Scholar
- [Orphanides et al., 1996]
- [Pedersen et al., 1999]