Evolutionary computation method for promoter site prediction in DNA

DOI10.1007/3-540-45110-2_62MaRDI QIDQ4449787zbMATH OpenFDO

Authors Daniel J. Howard, Karl Benson

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241690.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Protein sequences, DNA sequences (92D20)

Recommendations

• Promoter prediction with a GP-automaton
• Optimization of SVM parameters for recognition of regulatory DNA sequences
• An evolutionary model of DNA substring distribution
• A simple hyper-geometric approach for discovering putative transcription factor binding sites
• Motif discovery using an immune genetic algorithm

Cited in

(2)

• A hybrid promoter analysis methodology for prokaryotic genomes
• Promoter prediction with a GP-automaton

This page was built for publication: Evolutionary computation method for promoter site prediction in DNA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449787)