Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
FMGA: Finding Motifs by Genetic Algorithm
BIBE '04 Proceedings of the 4th IEEE Symposium on Bioinformatics and Bioengineering
Identification of weak motifs in multiple biological sequences using genetic algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
TFBS identification by position- and consensus-led genetic algorithm with local filtering
Proceedings of the 9th annual conference on Genetic and evolutionary computation
MOGAMOD: Multi-objective genetic algorithm for motif discovery
Expert Systems with Applications: An International Journal
Automated extraction of extended structured motifs using multi-objective genetic algorithm
Expert Systems with Applications: An International Journal
GAPK: genetic algorithms with prior knowledge for motif discovery in DNA sequences
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Motif discovery using multi-objective genetic algorithm in biosequences
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
Comparison of simple encoding schemes in GA's for the motif finding problem: preliminary results
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
Motif finding using ant colony optimization
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Finding motifs in DNA sequences applying a multiobjective artificial bee colony (MOABC) algorithm
EvoBIO'11 Proceedings of the 9th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
Comparing multiobjective artificial bee colony adaptations for discovering DNA motifs
EvoBIO'12 Proceedings of the 10th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Memetic algorithms for de novo motif-finding in biomedical sequences
Artificial Intelligence in Medicine
Comparing multiobjective swarm intelligence metaheuristics for DNA motif discovery
Engineering Applications of Artificial Intelligence
Hybrid multiobjective artificial bee colony with differential evolution applied to motif finding
EvoBIO'13 Proceedings of the 11th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Designing a novel hybrid swarm based multiobjective evolutionary algorithm for finding DNA motifs
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
MDABC: Motif Discovery Using Artificial Bee Colony Algorithm
Journal of Information Technology Research
Journal of Global Optimization
A parallel cooperative team of multiobjective evolutionary algorithms for motif discovery
The Journal of Supercomputing
Hi-index | 0.00 |
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive research for a decade. To predict the binding site locations efficiently, many algorithms that incorporate either approximate or heuristic techniques have been developed. However, the prediction accuracy is not satisfactory and binding site prediction thus remains a challenging problem. In this paper, we develop an approach that can be used to predict binding site motifs using a genetic algorithm. Based on the generic framework of a genetic algorithm, the approach explores the search space of all possible starting locations of the binding site motifs in different target sequences with a population that undergoes evolution. Individuals in the population compete to participate in the crossovers and mutations occur with a certain probability. Initial experiments demonstrated that our approach could achieve high prediction accuracy in a small amount of computation time. A promising advantage of our approach is the fact that the computation time does not explicitly depend on the length of target sequences and hence may not increase significantly when the target sequences become very long.