Finding motifs in DNA sequences applying a Multiobjective Artificial Bee Colony (MOABC) algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6623 LNCS, Issue , 2011, Pages 89-100

  González Álvarez, David L ^a   Vega Rodríguez, Miguel A ^a   Gómez Pulido, Juan A ^a   Sánchez Pérez, Juan M ^a  

^a UNIVERSITY OF EXTREMADURA   (Spain)

Author keywords

Artificial Bee Colony; DNA; motif finding; multiobjective optimization; Swarm Intelligence

Indexed keywords

ARTIFICIAL BEE COLONIES; COLLECTIVE INTELLIGENCES; GENE REGULATORY RELATIONSHIPS; HONEY BEE; MOTIF DISCOVERY; MOTIF FINDING; MULTI OBJECTIVE; MULTI-OBJECTIVE PROBLEM; NEW RESULTS; NP-HARD PROBLEM; OPTIMIZATION ALGORITHMS; SPECIFIC TASKS; SWARM INTELLIGENCE; TRANSCRIPTION FACTOR BINDING SITES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BINDING SITES; BIOINFORMATICS; CELLULAR AUTOMATA; COMPUTATIONAL COMPLEXITY; DATA MINING; DNA; DNA SEQUENCES; GENES; LEARNING SYSTEMS; TRANSCRIPTION; TRANSCRIPTION FACTORS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 79955779768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20389-3_9     Document Type: Conference Paper

References (22)

1. D'haeseleer, P.: What are DNA sequence motifs? Nature Biotechnology 24(4), 423-425 (2006)
2. Lawrence, C.E., Reilly, A.A.: An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins 7(1), 41-51 (1990)
3. Hertz, G.Z., Hartzell, G.W., Stormo, G.D.: Identification of consensus patterns in unaligned DNA sequences known to be functionally related. Computer Applications in the Biosciences 6(2), 81-92 (1990)
4. Bailey, T.L., Elkan, C.: Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 21(1-2), 51-80 (1995)
5. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., Wootton, J.C.: Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262(5131), 208-214 (1993)
6. Roth, F.P., Hughes, J.D., Estep, P.W., Church, G.M.: Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole genome mRNA quantitation. Nature Biotechnology 16(10), 939-945 (1998)
7. Pavesi, G., Mauri, G., Pesole, G.: An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics 17(suppl. 1), S207-S214 (2001)
8. Liu, F.F.M., Tsai, J.J.P., Chen, R.M., Chen, S.N., Shih, S.H.: FMGA: finding motifs by genetic algorithm. In: Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE 2004), p. 459 (2004)
9. Notredame, C., Higgins, D.G.: SAGA: Sequence alignment by genetic algorithm. Nucleic Acids Research 24(8), 1515-1524 (1996)
10. Stine, M., Dasgupta, D., Mukatira, S.: Motif discovery in upstream sequences of coordinately expressed genes. In: The 2003 Congress on Evolutionary Computational (CEC 2003), vol. 3, pp. 1596-1603 (2003)
11. Che, D., Song, Y., Rashedd, K.: MDGA: Motif discovery using a genetic algorithm. In: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation (GECCO 2005), USA, pp. 447-452 (2005)
12. Shao, L., Chen, Y.: Bacterial Foraging Optimization Algorithm Integrating Tabu Search for Motif Discovery. In: IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2009), pp. 415-418 (2009)
13. Shao, L., Chen, Y., Abraham, A.: Motif Discovery using Evolutionary Algorithms. In: International Conference of Soft Computing and Pattern Recognition (SOCPAR 2009), pp. 420-425 (2009)
14. Kaya, M.: MOGAMOD: Multi-objective genetic algorithm for motif discovery. Expert Systems with Applications: An International Journal 36(2), 1039-1047 (2009)
15. Karaboga, D.: An idea based on honey bee swarm for numerical optimization, Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)
16. Karaboga, D., Basturk, B.: A Powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm. Journal of Global Optimization 39(3), 459-471 (2007)
17. González-Álvarez, D.L., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sánchez- Pérez, J.M.: Solving the Motif Discovery Problem by Using Differential Evolution with Pareto Tournaments. In: Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC 2010), pp. 4140-4147. IEEE Computer Society, Los Alamitos (2010)
18. González-Álvarez, D.L., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sónchez- Pérez, J.M.: A Multiobjective Variable Neighborhood Search for Solving the Motif Discovery Problem. In: Advances in Intelligent and Soft Computing, vol. 73, pp. 39-46. Springer, Heidelberg (2010)
19. Weicker, N., Szabo, G., Weicker, K., Widmayer, P.: Evolutionary Multiobjective Optimization for Base Station Transmitter Placement With Frequency Assignment. IEEE Transactions on Evolutionary Computation 7, 189-203 (2003)
20. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA II. IEEE Transactions on Evolutionary Computation 6, 182-197 (2002)
21. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. IEEE Transactions on Evolutionary Computation 8(2), 173-195 (2000)
22. Wingender, E., Dietze, P., Karas, H., Knüppel, R.: TRANSFAC: a database on transcription factors and their DNA binding sites. Nucleic Acids Research 24(1), 238-241 (1996)