Abstract
Finding motifs in gene sequences is one of the most important problems of bioinformatics and belongs to NP-hard type. This paper proposes a new ant colony optimization algorithm based on consensus approach, in which a relax technique is applied to find the location of the motif. The efficiency of the algorithm is evaluated by comparing it with the state-of-the-art algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bandyopadhyay, S., Sahni, S., Rajasekaran, S.: Pms6: A faster algorithm for motif discovery. In: Proceedings of the second IEEE Int. Conf. on Computational Advances in Bio and Medical Sciences, pp. 1–6 (2012)
Bouamama, S., Boukerram, A., Al-Badarneh, A.F.: Motif finding using ant colony optimization. In: Dorigo, M., et al. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 464–471. Springer, Heidelberg (2010)
Chen, X.S., Ong, Y.S., Lim, M.H.: Research frontier: memetic computation - past, present & future. IEEE Computational Intelligence Magazine 5(2), 24–36 (2011)
Claeys, M., Storms, V., Sun, H., Michoel, T., Marchal, K.: MotifSuite: workflow for probabilistic motif detection and assessment. Bioinformatics 28(14), 1931–1932 (2012), doi:10.1093/bioinformatics/bts293
Dinh, H., Rajasekaran, S., Davila, J.: qPMS7: A fast algorithm for finding the (l; d)-motif in DNA and protein sequences. PLoS One 7(7), e41425 (2012)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Eskin, E., Pevzner, P.: Finding composite regulatory patterns in DNA sequences. Bioinformatics S1, 354–363 (2002)
Hoang Xuan, H., Do Duc, D., Manh Ha, N.: An efficient two-phase ant colony optimization algorithm for the closest string problem, pp. 188–197 (2012)
Xuan, H., NguyenLinh, T., Do Duc, D., Huu Tue, H.: Solving the traveling salesman problem with ant colony optimization: arevisit and new efficient algorithms. REV Journal on Electronics and Communications 2(3-4), 121–129 (2012)
Keith, M.K.: A simulated annealing algorithm for finding consensus sequences. J. Bioinformatics 18, 1494–1499 (2002)
Liu, W., Chen, H., Chen, L.: An ant colony optimization based algorithm for identifying gene regulatory elements. Comp. in Bio. and Med. 43(7), 922–932 (2013)
Lo, N.W., Changchien, S.W., Chang, Y.F., Lu, T.C.: Human promoter prediction based on sorted consensus sequence patterns by genetic algorithms. Proc. of the Int. Congress on Biological and Medical Engineering D3I-1540, 111–112 (2002)
Moscato, P.: Onevolution, search, optimization, genetic algorithms and martial arts: towards memeticalgorithms. Tech. Rep.Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, California, USA (1989)
Neuwald, A., Liu, J., Lawrence, C.: Gibbs motif sampling: detection of bacterial outer membrane protein repeats. Protein Science, 1618–1632 (1995)
Pisanti, N., Carvalho, A.M., Marsan, L., Sagot, M.-F.: RISOTTO: Fast extraction of motifs with mismatches. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 757–768. Springer, Heidelberg (2006)
Stormo, G.D., Hartzell, G.W.: Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl. Acad. Sci. USA 86(4), 1183–1187 (1989)
Stormo, G.D., Hartzell, G.W.: Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl. Acad. Sci. USA 86(4), 1183–1187 (1989)
Thompson, W., Eric, C.R., Lawrence, E.L.: Gibbsrecursive sampler: finding transcription factor binding sites. J. Nucleic Acids Research 31, 3580–3585 (2003)
Yang, C.H., Liu, Y.T., Chuang, L.Y.: DNA motif discovery based on ant colony optimization and expectation maximization. In: Proc. of IMECS, pp. 169–174 (2011)
http://bioinformatics.psb.ugent.be/webtools/MotifSuite/Index.htm#pub
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Huan, H.X., Tuyet, D.T.A., Ha, D.T.T., Hung, N.T. (2015). An Efficient Ant Colony Algorithm for DNA Motif Finding. In: Nguyen, VH., Le, AC., Huynh, VN. (eds) Knowledge and Systems Engineering. Advances in Intelligent Systems and Computing, vol 326. Springer, Cham. https://doi.org/10.1007/978-3-319-11680-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-11680-8_47
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11679-2
Online ISBN: 978-3-319-11680-8
eBook Packages: EngineeringEngineering (R0)