Created by W.Langdon from gp-bibliography.bib Revision:1.8051
Secondly, having identified exon with substructure we use machine learning to try and identify patterns in the DNA sequence lying between blocks of high correlation which might yield biological or technological explanations. A Backus-Naur form (BNF) context-free grammar constrains strongly typed genetic programming (STGP) to evolve biological motifs in the form of regular expressions (RE) (e.g. TCTTT) which classify gene exons with potential alternative mRNA expression from those without. We show biological patterns can be data mined by a GP written in gawk and using egrep from NCBI's GEO http://www.ncbi.nlm.nih.gov/geo/ database. The automatically produced DNA motifs suggest that alternative polyadenylation is not responsible. (Full version in TR-09-02 \cite{langdon:2009:TR-09-02}.)
Blocky exons can be found in (broken see data_url) http://bioinformatics.essex.ac.uk/users/wlangdon/tr-09-02.tar.gz",
GECCO-2009 A joint meeting of the eighteenth international conference on genetic algorithms (ICGA-2009) and the fourteenth annual genetic programming conference (GP-2009).
ACM Order Number 910092. Also known as \cite{DBLP:conf/gecco/LangdonRH09}",
Genetic Programming entries for William B Langdon J Rowsell Andrew P Harrison