{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T23:38:19Z","timestamp":1720741099410},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,24]],"date-time":"2017-02-24T00:00:00Z","timestamp":1487894400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11786-017-0293-5","type":"journal-article","created":{"date-parts":[[2017,2,24]],"date-time":"2017-02-24T03:42:24Z","timestamp":1487907744000},"page":"233-249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving the Minimum Common String Partition Problem with the Help of Ants"],"prefix":"10.1007","volume":"11","author":[{"given":"S. M.","family":"Ferdous","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,24]]},"reference":[{"key":"293_CR1","doi-asserted-by":"crossref","unstructured":"Blum, C.: Beam-ACO for the longest common subsequence problem. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5585928"},{"key":"293_CR2","doi-asserted-by":"crossref","unstructured":"Blum, C., Lozano, J., Davidson, P.P.: Iterative probabilistic tree search for the minimum common string partition problem. In: Blesa, M., Blum, C., Vo\u00df, S. (eds.) Hybrid Metaheuristics, pp. 145\u2013154. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07644-7_11"},{"key":"293_CR3","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.ejor.2014.10.049","volume":"242","author":"C Blum","year":"2015","unstructured":"Blum, C., Lozano, J., Davidson, P.P.: Mathematical programming strategies for solving the minimum common string partition problem. Eur. J. Oper. Res. 242, 769\u2013777 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"293_CR4","doi-asserted-by":"crossref","first-page":"3620","DOI":"10.1016\/j.cor.2007.03.007","volume":"35","author":"C Blum","year":"2008","unstructured":"Blum, C., Vall\u00e8s, M.Y., Blesa, M.J.: An ant colony optimization algorithm for dna sequencing by hybridization. Comput. Oper. Res. 35(11), 3620\u20133635 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"293_CR5","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE\/ACM Trans. Comput. Biol. Bioinform. 2(4), 302\u2013315 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"293_CR6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/1103963.1103971","volume":"1","author":"M Chrobak","year":"2005","unstructured":"Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. ACM Trans. Algorithms 1(2), 350\u2013366 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"293_CR7","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K., Lagergren, J. (eds.) Algorithms in Bioinformatics. Lecture Notes in Computer Science, vol. 5251, pp. 87\u201398. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-87361-7_8"},{"key":"293_CR8","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Milan (1992)"},{"key":"293_CR9","unstructured":"Dorigo, M., Colorni, A., Maniezzo, V.: Positive feedback as a search strategy. Technical report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Milan (1991)"},{"issue":"2","key":"293_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life 5(2), 137\u2013172 (1999)","journal-title":"Artif. Life"},{"issue":"1","key":"293_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"Trans. Evol. Comput."},{"issue":"1","key":"293_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"key":"293_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Company, Scituate (2004)"},{"key":"293_CR14","first-page":"227","volume-title":"Handbook of Metaheuristics. International Series in Operations Research & Management Science","author":"M Dorigo","year":"2010","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant colony optimization: overview and recent advances. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 227\u2013263. Springer, New York (2010)"},{"key":"293_CR15","doi-asserted-by":"crossref","unstructured":"Ferdous, S., Das, A., Rahman, M., Rahman, M.: Ant colony optimization approach to solve the minimum string cover problem. In: International Conference on Informatics, Electronics and Vision (ICIEV), pp. 741\u2013746. IEEE (2012)","DOI":"10.1109\/ICIEV.2012.6317422"},{"key":"293_CR16","doi-asserted-by":"crossref","unstructured":"Ferdous, S., Rahman, M.: Solving the minimum common string partition problem with the help of ants. In: Tan, Y., Shi, Y., Mo, H. (eds.) Advances in Swarm Intelligence. Lecture Notes in Computer Science, vol. 7928, pp. 306\u2013313. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38703-6_36"},{"key":"293_CR17","doi-asserted-by":"crossref","first-page":"e0130266","DOI":"10.1371\/journal.pone.0130266","volume":"10","author":"SM Ferdous","year":"2015","unstructured":"Ferdous, S.M., Rahman, M.S.: An integer programming formulation of the minimum common string partition problem. PLoS ONE 10, e0130266 (2015)","journal-title":"PLoS ONE"},{"key":"293_CR18","first-page":"252","volume-title":"Ant-q: a reinforcement learning approach to the traveling salesman problem","author":"L Gambardella","year":"1995","unstructured":"Gambardella, L., Dorigo, M.: Ant-q: a reinforcement learning approach to the traveling salesman problem, pp. 252\u2013260. Morgan Kaufmann, Los Altos (1995)"},{"key":"293_CR19","doi-asserted-by":"crossref","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partitioning problem: hardness and approximations. Electron. J. Comb. 12(R50) (2005)","DOI":"10.37236\/1947"},{"key":"293_CR20","doi-asserted-by":"crossref","unstructured":"Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. In: Proceedings of the 4th International Conference on Frontiers in Algorithmics, FAW\u201910, pp. 45\u201352. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14553-7_7"},{"issue":"1","key":"293_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.cor.2007.07.006","volume":"36","author":"SJ Shyu","year":"2009","unstructured":"Shyu, S.J., Tsai, C.-Y.: Finding the longest common subsequence for multiple biological sequences by ant colony optimization. Comput. Oper. Res. 36(1), 73\u201391 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"293_CR22","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.2144\/00286ir01","volume":"28","author":"P Stothard","year":"2000","unstructured":"Stothard, P.: The sequence manipulation suite: Javascript programs for analyzing and formatting protein and DNA sequences. Biotechniques 28(6), 1102 (2000)","journal-title":"Biotechniques"},{"key":"293_CR23","unstructured":"St\u00fctzle, T., Hoos, H.: Improving the ant system: a detailed report on the max\u2013min ant system. Technical report (1996)"},{"key":"293_CR24","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: Max\u2013min ant system and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation (ICEC\u201997), pp. 309\u2013314. IEEE Press (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"9","key":"293_CR25","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max\u2013min ant system. Future Gener. Comput. Syst. 16(9), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"293_CR26","unstructured":"Villesen, P.: Fabox: an online FASTA sequence toolbox (2007)"},{"issue":"1","key":"293_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G Watterson","year":"1982","unstructured":"Watterson, G., Ewens, W., Hall, T., Morgan, A.: The chromosome inversion problem. J. Theor. Biol. 99(1), 1\u20137 (1982)","journal-title":"J. Theor. Biol."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-017-0293-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0293-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0293-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T23:46:48Z","timestamp":1601682408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-017-0293-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,24]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["293"],"URL":"https:\/\/doi.org\/10.1007\/s11786-017-0293-5","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,24]]}}}