{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:40:56Z","timestamp":1725795656247},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076430"},{"type":"electronic","value":"9783319076447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07644-7_11","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T17:27:11Z","timestamp":1401902831000},"page":"145-154","source":"Crossref","is-referenced-by-count":7,"title":["Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 A.","family":"Lozano","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Pinacho Davidson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C. Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing\u00a011(6), 4135\u20134151 (2011)","journal-title":"Applied Soft Computing"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Computing the assignment of orthologous genes via genome rearrangement. In: Proceedings of the Asia Pacific Bioinformatics Conference 2005, pp. 363\u2013378 (2005)","DOI":"10.1142\/9781860947322_0037"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-27821-4_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Chrobak","year":"2004","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.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 84\u201395. Springer, Heidelberg (2004)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","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 Transactions on Algorithms\u00a03(2), 1\u201319 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"11_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-87361-7_8","volume-title":"Algorithms in Bioinformatics","author":"P. Damaschke","year":"2008","unstructured":"Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 87\u201398. Springer, Heidelberg (2008)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-38703-6_36","volume-title":"Advances in Swarm Intelligence","author":"S.M. Ferdous","year":"2013","unstructured":"Ferdous, S.M., Rahman, M.S.: Solving the minimum common string partition problem with the help of ants. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part I. LNCS, vol.\u00a07928, pp. 306\u2013313. Springer, Heidelberg (2013)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Festa, P., Resende, M.: GRASP: An annotated bibliography. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325\u2013367. Kluwer Academic Publishers (2002)","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-22616-8_24","volume-title":"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.) COCOA 2011. LNCS, vol.\u00a06831, pp. 299\u2013310. Springer, Heidelberg (2011)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-30551-4_43","volume-title":"Algorithms and Computation","author":"A. Goldstein","year":"2004","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 484\u2013495. Springer, Heidelberg (2004)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-21458-5_24","volume-title":"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.) CPM 2011. LNCS, vol.\u00a06661, pp. 273\u2013284. Springer, Heidelberg (2011)"},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"11_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-72031-7_40","volume-title":"Bioinformatics Research and Applications","author":"D. He","year":"2007","unstructured":"He, D.: A novel greedy algorithm for the minimum common string partition problem. In: M\u0103ndoiu, I.I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS (LNBI), vol.\u00a04463, pp. 441\u2013452. Springer, Heidelberg (2007)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01934514","volume":"24","author":"W.J. Hsu","year":"1984","unstructured":"Hsu, W.J., Du, M.W.: Computing a longest common subsequence for a set of strings. BIT Numerical Mathematics\u00a024(1), 45\u201359 (1984)","journal-title":"BIT Numerical Mathematics"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","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. Journal of Combinatorial Optimization\u00a023(4), 519\u2013527 (2012)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","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. Information Processing Letters\u00a097(1), 23\u201327 (2006)","journal-title":"Information Processing Letters"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/11549345_50","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Kolman","year":"2005","unstructured":"Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 580\u2013590. Springer, Heidelberg (2005)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/11970125_22","volume-title":"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.) WAOA 2006. LNCS, vol.\u00a04368, pp. 279\u2013289. Springer, Heidelberg (2007)"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","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 Engineering in Medicine and Biology Magazine\u00a024(3), 81\u201387 (2005)","journal-title":"IEEE Engineering in Medicine and Biology Magazine"},{"key":"11_CR19","doi-asserted-by":"publisher","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. Journal of Heuristics\u00a018, 239\u2013262 (2012)","journal-title":"Journal of Heuristics"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45452-7_9","volume-title":"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.) CPM 2002. LNCS, vol.\u00a02373, pp. 85\u201398. Springer, Heidelberg (2002)"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","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. Journal of Molecular Biology\u00a0147(1), 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07644-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T20:45:47Z","timestamp":1558903547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07644-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076430","9783319076447"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07644-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}