{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:51:44Z","timestamp":1753357904706},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,23]],"date-time":"2015-07-23T00:00:00Z","timestamp":1437609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FN:Spanish Government","award":["GN:ID0EIGAE2"],"award-info":[{"award-number":["GN:ID0EIGAE2"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11590-015-0921-4","type":"journal-article","created":{"date-parts":[[2015,7,22]],"date-time":"2015-07-22T07:54:11Z","timestamp":1437551651000},"page":"189-205","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Computational performance evaluation of two integer linear programming models for the minimum common string partition problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,23]]},"reference":[{"key":"921_CR1","doi-asserted-by":"crossref","unstructured":"Blum, C., Lozano, J.A., Pinacho Davidson, P.: Iterative probabilistic tree search for the minimum common string partition problem. In: Blesa, M.J., Blum, C., Voss, S. (eds.) Proceedings of HM 20104\u20149th International Workshop on Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 8457, pp. 154\u2013154. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07644-7_11"},{"issue":"3","key":"921_CR2","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.A., Pinacho Davidson, P.: Mathematical programming strategies for solving the minimum common string partition problem. Eur. J. Oper. Res. 242(3), 769\u2013777 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"921_CR3","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."},{"key":"921_CR4","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) Proceedings of APPROX 2004\u20147th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 3122, pp. 84\u201395. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-27821-4_8"},{"issue":"2","key":"921_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1186810.1186812","volume":"3","author":"G Cormode","year":"2007","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Trans. Algorithms 3(2), 1\u201319 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"921_CR6","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K.A., Lagergren, J. (eds.) Proceedings of WABI 2008\u20148th International Workshop on 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":"921_CR7","doi-asserted-by":"crossref","unstructured":"Ferdous, S.M., Sohel Rahman, M.: Solving the minimum common string partition problem with the help of ants. In: Tan, Y., Shi, Y., Mo, H. (eds.) Proceedings of ICSI 2013\u20144th International Conference on 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":"921_CR8","unstructured":"Ferdous, S.M., Sohel Rahman, M.: A MAX\u2013MIN ant colony system for minimum common string partition problem (2014). arXiv:1401.4539"},{"key":"921_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-642-22616-8_24","volume-title":"Proceedings of COCOA 2011\u20145th International Conference on Combinatorial Optimization and Applications","author":"B Fu","year":"2011","unstructured":"Fu, B., Jiang, H., Yang, B., Zhu, B.: Exponential and polynomial time algorithms for the minimum common string partition problem. In: Wang, W., Zhu, X., Du, D.Z. (eds.) Proceedings of COCOA 2011\u20145th International Conference on Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol. 6831, pp. 299\u2013310. Springer, Berlin (2011)"},{"key":"921_CR10","doi-asserted-by":"crossref","unstructured":"Gallardo, J.E.: A multilevel probabilistic beam search algorithm for the shortest common supersequence problem. PLoS One 7(12) (2012)","DOI":"10.1371\/journal.pone.0052427"},{"key":"921_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)"},{"key":"921_CR12","series-title":"Lecture Notes in Computer Science","first-page":"484","volume-title":"Proceedings of ISAAC 2004\u201415th International Symposium on Algorithms and Computation","author":"A Goldstein","year":"2005","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) Proceedings of ISAAC 2004\u201415th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 3341, pp. 484\u2013495. Springer, Berlin (2005)"},{"key":"921_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-642-21458-5_24","volume-title":"Proceedings of CPM 2011\u201422nd Annual Symposium on Combinatorial Pattern Matching","author":"I Goldstein","year":"2011","unstructured":"Goldstein, I., Lewenstein, M.: Quick greedy computation for minimum common string partitions. In: Giancarlo, R., Manzini, G. (eds.) Proceedings of CPM 2011\u201422nd Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 6661, pp. 273\u2013284. Springer, Berlin (2011)"},{"key":"921_CR14","series-title":"Lecture Notes in Computer Science","first-page":"441","volume-title":"Proceedings of ISBRA 2007\u2014Third International Symposium on Bioinformatics Research and Applications","author":"D He","year":"2007","unstructured":"He, D.: A novel greedy algorithm for the minimum common string partition problem. In: Mandoiu, I., Zelikovsky, A. (eds.) Proceedings of ISBRA 2007\u2014Third International Symposium on Bioinformatics Research and Applications. Lecture Notes in Computer Science, vol. 4463, pp. 441\u2013452. Springer, Berlin (2007)"},{"key":"921_CR15","doi-asserted-by":"crossref","unstructured":"Hsu, W.J., Du, M.W.: Computing a longest common subsequence for a set of strings. BIT Numer. Math. 24(1), 45\u201359 (1984). doi: 10.1007\/BF01934514","DOI":"10.1007\/BF01934514"},{"issue":"4","key":"921_CR16","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s10878-010-9370-2","volume":"23","author":"H Jiang","year":"2012","unstructured":"Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. J. Comb. Optim. 23(4), 519\u2013527 (2012)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"921_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ipl.2005.08.010","volume":"97","author":"H Kaplan","year":"2006","unstructured":"Kaplan, H., Shafrir, N.: The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1), 23\u201327 (2006)","journal-title":"Inf. Process. Lett."},{"key":"921_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/11549345_50","volume-title":"Proceedings of MFCS 2005\u201430th International Symposium on Mathematical Foundations of Computer Science","author":"P Kolman","year":"2005","unstructured":"Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates. In: Jedrzejowicz, J., Szepietowski, A. (eds.) Proceedings of MFCS 2005\u201430th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 3618, pp. 580\u2013590. Springer, Berlin (2005)"},{"key":"921_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/11970125_22","volume-title":"Proceedings of WAOA 2007\u20144th International Workshop on Approximation and Online Algorithms","author":"P Kolman","year":"2007","unstructured":"Kolman, P., Wale\u0144, T.: Reversal distance for strings with duplicates: linear time approximation using hitting set. In: Erlebach, T., Kaklamanis, C. (eds.) Proceedings of WAOA 2007\u20144th International Workshop on Approximation and Online Algorithms. Lecture Notes in Computer Science, vol. 4368, pp. 279\u2013289. Springer, Berlin (2007)"},{"issue":"3","key":"921_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/MEMB.2005.1436464","volume":"24","author":"C Meneses","year":"2005","unstructured":"Meneses, C., Oliveira, C., Pardalos, P.: Optimization techniques for string selection and comparison problems in genomics. IEEE Eng. Med. Biol. Mag. 24(3), 81\u201387 (2005)","journal-title":"IEEE Eng. Med. Biol. Mag."},{"key":"921_CR21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10732-011-9177-z","volume":"18","author":"S Mousavi","year":"2012","unstructured":"Mousavi, S., Babaie, M., Montazerian, M.: An improved heuristic for the far from most strings problem. J. Heuristics 18, 239\u2013262 (2012)","journal-title":"J. Heuristics"},{"key":"921_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-45452-7_9","volume-title":"Proceedings of CPM 2002\u201413th Annual Symposium on Combinatorial Pattern Matching","author":"D Shapira","year":"2002","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. In: Apostolico, A., Takeda, M. (eds.) Proceedings of CPM 2002\u201413th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 2373, pp. 85\u201398. Springer, Berlin (2002)"},{"issue":"1","key":"921_CR23","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195\u2013197 (1981)","journal-title":"J. Mol. Biol."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0921-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0921-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0921-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:42Z","timestamp":1559409102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0921-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,23]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["921"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0921-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,23]]}}}