Evolutionary Computation Method for Promoter Site Prediction in DNA

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

@InProceedings{howard:2003:gecco,

• author = "Daniel Howard and Karl Benson",
• title = "Evolutionary Computation Method for Promoter Site Prediction in {DNA}",
• booktitle = "Genetic and Evolutionary Computation -- GECCO-2003",
• editor = "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and R. Standish and G. Kendall and S. Wilson and M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and A. C. Schultz and K. Dowsland and N. Jonoska and J. Miller",
• year = "2003",
• pages = "1690--1701",
• address = "Chicago",
• publisher_address = "Berlin",
• month = "12-16 " # jul,
• volume = "2724",
• series = "LNCS",
• ISBN = "3-540-40603-4",
• publisher = "Springer-Verlag",
• keywords = "genetic algorithms, genetic programming",
• DOI = "doi:10.1007/3-540-45110-2_62",
• abstract = "develops an evolutionary method that learns inductively to recognize the makeup and the position of very short consensus sequences, which are a typical feature of promoters in eukaryotic genomes. This class of method can be used to discover candidate promoter sequences in primary sequence data. If further developed, it has the potential to discover genes which are regulated together.",
• notes = "GECCO-2003. A joint meeting of the twelfth International Conference on Genetic Algorithms (ICGA-2003) and the eighth Annual Genetic Programming Conference (GP-2003)",

}

Genetic Programming entries for Daniel Howard Karl A Benson

Citations