{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:09:22Z","timestamp":1751602162660,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319897424"},{"type":"electronic","value":"9783319897431"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89743-1_17","type":"book-chapter","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T18:28:27Z","timestamp":1523471307000},"page":"185-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Cooperative Method to Solve Multiple Sequence Alignment Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2239-1087","authenticated-orcid":false,"given":"Lamiche","family":"Chaabane","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"issue":"9","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1093\/bioinformatics\/btg133","volume":"19","author":"JD Thompson","year":"2003","unstructured":"Thompson, J.D., Thierry, J.C., Poch, O.: RASCAL: rapid scanning and correction of multiple sequence alignments. Bioinformatics 19(9), 1155\u20131161 (2003)","journal-title":"Bioinformatics"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"T Jiang","year":"1994","unstructured":"Jiang, T., Wang, L.: On the complexity of multiple sequence alignment. J. Comput. Biol. 1, 337\u2013378 (1994)","journal-title":"J. Comput. Biol."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(99)00324-2","volume":"259","author":"P Bonizzoni","year":"2001","unstructured":"Bonizzoni, P., Della Vedova, G.: The complexity of multiple sequence alignment with SP-score that is a metric. Theor. Comput. Sci. 259, 63\u201379 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR4","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York (1998)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s00500-004-0356-9","volume":"9","author":"JT Horng","year":"2005","unstructured":"Horng, J.T., Wu, L.C., Lin, C.M., Yang, B.H.: A Genetic algorithm for multiple sequence alignment. Soft Comput. 9, 407\u2013420 (2005)","journal-title":"Soft Comput."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.72.031915","volume":"72","author":"M Hern\u00e1ndez-Gu\u00eda","year":"2005","unstructured":"Hern\u00e1ndez-Gu\u00eda, M., Mulet, R., Rodr\u00edguez-P\u00e9rez, S.: A new simulated annealing algorithm for the multiple sequence alignment problem. The approach of polymers in a random media. Phys. Rev. E 72, 1\u20137 (2005)","journal-title":"Phys. Rev. E"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Lei, C.W., Ruan, J.H.: A particle swarm optimization algorithm for finding DNA sequence motifs. In: Proceedings IEEE, pp. 166\u2013173 (2008)","DOI":"10.1109\/BIBMW.2008.4686231"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.asoc.2006.10.012","volume":"8","author":"ZJ Lee","year":"2008","unstructured":"Lee, Z.J., Su, S.F., Chuang, C.C., Liu, K.H.: Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl. Soft Comput. 8, 55\u201378 (2008)","journal-title":"Appl. Soft Comput."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Chen, L., Zou, L., Chen, J.: An efficient ant colony algorithm for multiple sequences alignment. In: Proceedings of the 3rd International Conference on Natural Computation (ICNC 2007), pp. 208\u2013212 (2007)","DOI":"10.1109\/ICNC.2007.189"},{"key":"17_CR10","unstructured":"Riaz, T., Wang, Y., Li, K.B.: Multiple sequence alignment using tabu search. In: Proceedings of 2nd Asia-Pacific Bioinformatics Conference (APBC), Dunedin, New Zealand, pp. 223\u2013232 (2004)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/978-3-642-04020-7_104","volume-title":"Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence","author":"F Xu","year":"2009","unstructured":"Xu, F., Chen, Y.: A method for multiple sequence alignment based on particle swarm optimization. In: Huang, D.-S., Jo, K.-H., Lee, H.-H., Kang, H.-J., Bevilacqua, V. (eds.) ICIC 2009. LNCS (LNAI), vol. 5755, pp. 965\u2013973. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04020-7_104"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Chen, Y., Hu, J., Hirasawa, K., Yu, S.: Multiple sequence alignment based on genetic algorithm with reserve selection. In: Proceedings of International Conference on Networking, Sensing and Control (ICNSC), pp. 1511\u20131516 (2008)","DOI":"10.1109\/ICNSC.2008.4525460"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Long, H.X., Xu, W.B., Sun, J., Ji, W.J.: Multiple sequence alignment based on a binary particle swarm optimization algorithm. In: Proceedings of Fifth International Conference on Natural Computation, pp. 265\u2013269 (2009)","DOI":"10.1109\/ICNC.2009.238"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Lei, X., Sun, J., Xu, X., Guo, L.: Artificial bee colony algorithm for solving multiple sequence alignment. In: Proceedings of 2010 IEEE Fifth International Conference on BIC-TA, pp. 337\u2013342 (2010)","DOI":"10.1109\/BICTA.2010.5645304"},{"issue":"6","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1093\/nar\/gkq1052","volume":"39","author":"V Cutello","year":"2011","unstructured":"Cutello, V., Nicosia, G., Pavone, M., Prizzi, I.: Protein multiple sequence alignment by hybrid bio-inspired algorithms. Nucleic Acids Res. 39(6), 1980\u20131992 (2011)","journal-title":"Nucleic Acids Res."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5402\/2012\/178658","volume":"2012","author":"E Li\u00f1\u00e1n-Garc\u00eda","year":"2012","unstructured":"Li\u00f1\u00e1n-Garc\u00eda, E., Gallegos-Araiza, L.M.: Simulated annealing with previous solutions applied to DNA sequence alignment. ISRN Artif. Intell. 2012, 1\u20136 (2012)","journal-title":"ISRN Artif. Intell."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.14257\/ijast.2013.61.04","volume":"61","author":"A Abu-Srhan","year":"2013","unstructured":"Abu-Srhan, A., Al Daoud, E.: A hybrid algorithm using a genetic algorithm and cuckoo search algorithm to solve the traveling salesman problem and its application to multiple sequence alignment. Int. J. Adv. Sci. Technol. 61, 29\u201338 (2013)","journal-title":"Int. J. Adv. Sci. Technol."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cmpb.2014.01.013","volume":"114","author":"M Kayaa","year":"2014","unstructured":"Kayaa, M., Sarhanb, A., Alhajjb, R.: Multiple sequence alignment with affine gap by using multi-objective genetic algorithm. Comput. Meth. Programs Biomed. 114, 38\u201349 (2014)","journal-title":"Comput. Meth. Programs Biomed."},{"key":"17_CR19","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, vol. 4, pp. 1942\u20131948, (1995)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"17_CR21","first-page":"123","volume":"3","author":"PF Rodriguez","year":"2007","unstructured":"Rodriguez, P.F., Nino, L.F., Alonso, O.M.: Multiple sequence alignment using swarm intelligence. Int. J. Comput. Intell. Res. 3(2), 123\u2013130 (2007)","journal-title":"Int. J. Comput. Intell. Res."},{"issue":"2","key":"17_CR22","first-page":"2395","volume":"17","author":"C Lamiche","year":"2017","unstructured":"Lamiche, C.: An effective alignment technique to solve MSA problem. Asian J. Math. Comput. 17(2), 2395\u20134213 (2017)","journal-title":"Asian J. Math. Comput."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1093\/bioinformatics\/15.1.87","volume":"15","author":"JD Thompson","year":"1999","unstructured":"Thompson, J.D., Plewniak, F., Poch, O.: BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15, 87\u201388 (1999)","journal-title":"Bioinformatics"},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12293-015-0157-y","volume":"7","author":"S Lalwani","year":"2015","unstructured":"Lalwani, S., Kumar, R., Gupta, N.: A novel two-level particle swarm optimization approach for efficient multiple sequence alignment. Memet. Comput. 7(2), 119\u2013133 (2015)","journal-title":"Memet. Comput."},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/prot.20527","volume":"61","author":"JD Thompson","year":"2005","unstructured":"Thompson, J.D., Koehl, P., Ripp, R., Poch, O.: BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 61(1), 127\u2013136 (2005)","journal-title":"Proteins"},{"issue":"13","key":"17_CR26","doi-asserted-by":"publisher","first-page":"2682","DOI":"10.1093\/nar\/27.13.2682","volume":"27","author":"JD Thompson","year":"1999","unstructured":"Thompson, J.D., Plewniak, F., Poch, O.: A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res. 27(13), 2682\u20132690 (1999)","journal-title":"Nucleic Acids Res."}],"container-title":["IFIP Advances in Information and Communication Technology","Computational Intelligence and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89743-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T16:01:50Z","timestamp":1751558510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89743-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319897424","9783319897431"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89743-1_17","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}