{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:36:19Z","timestamp":1755999379982,"version":"3.41.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_1","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"1","key":"1_CR1","first-page":"21","volume":"8","author":"G Agnarsson","year":"2010","unstructured":"Agnarsson, G., Greenlaw, R., Kantabutra, S.: On the graph relabeling problem. Thai J. Math. 8(1), 21\u201342 (2010)","journal-title":"Thai J. Math."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Akutsu, T.: A linear time pattern matching algorithm between a string and a tree. In: Proceedings of 4th Symposium on Combinatorial Pattern Matching (CPM), pp. 1\u201310, Padova (1993)","DOI":"10.1007\/BFb0029792"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-75530-2_4","volume-title":"String Processing and Information Retrieval","author":"A Amir","year":"2007","unstructured":"Amir, A., Aumann, Y., Indyk, P., Levy, A., Porat, E.: Efficient computations of $$\\ell _{1}$$ and $$\\ell _{\\infty }$$ rearrangement distances. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 39\u201349. Springer, Heidelberg (2007)"},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/S0097539702424496","volume":"35","author":"A Amir","year":"2006","unstructured":"Amir, A., Aumann, A., Lewenstein, M., Porat, E.: Function matching. SIAM J. Comput. 35(5), 1007\u20131022 (2006)","journal-title":"SIAM J. Comput."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: Proceedings of 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1221\u20131229 (2006)","DOI":"10.1145\/1109557.1109692"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-69068-9_13","volume-title":"Combinatorial Pattern Matching","author":"A Amir","year":"2008","unstructured":"Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 118\u2013129. Springer, Heidelberg (2008)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Landau, G., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. In: Proceedings of 38th IEEE FOCS, pp. 144\u2013153 (1997)","DOI":"10.1109\/SFCS.1997.646103"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/jagm.2000.1120","volume":"37","author":"A Amir","year":"2000","unstructured":"Amir, A., Aumann, Y., Landau, G., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247\u2013266 (2000). (Preliminary version appeared at FOCS 1997)","journal-title":"J. Algorithms"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(02)00035-4","volume":"181","author":"A Amir","year":"2003","unstructured":"Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Inf. Comput. 181(1), 57\u201374 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00453-005-1192-8","volume":"45","author":"A Amir","year":"2006","unstructured":"Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorithmica 45(1), 109\u2013120 (2006)","journal-title":"Algorithmica"},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1137\/080712969","volume":"39","author":"A Amir","year":"2009","unstructured":"Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. SIAM J. Comp. 39(4), 1444\u20131461 (2009)","journal-title":"SIAM J. Comp."},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00151-3","volume":"68","author":"A Amir","year":"1998","unstructured":"Amir, A., Landau, G.M., Lewenstein, M., Lewenstein, N.: Efficient special cases of pattern matching with swaps. Inf. Process. Lett. 68(3), 125\u2013132 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0020-0190(01)00302-7","volume":"83","author":"A Amir","year":"2002","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Approximate swapped matching. Inf. Process. Lett. 83(1), 33\u201339 (2002)","journal-title":"Inf. Process. Lett."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.1999.1063","volume":"35","author":"A Amir","year":"2000","unstructured":"Amir, A., Lewenstein, N., Lewenstein, M.: Pattern matching in hypertext. J. Algorithms 35, 82\u201399 (2000)","journal-title":"J. Algorithms"},{"issue":"15","key":"1_CR15","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.ipl.2009.04.012","volume":"109","author":"A Amir","year":"2009","unstructured":"Amir, A., Navarro, G.: Parameterized matching of non-linear structures. Inf. Process. Lett. 109(15), 864\u2013867 (2009)","journal-title":"Inf. Process. Lett."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: From coding theory to efficient pattern matching. In: Proceedings of 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 778\u2013784 (2009)","DOI":"10.1137\/1.9781611973068.85"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-75520-3_15","volume-title":"Algorithms \u2013 ESA 2007","author":"R Clifford","year":"2007","unstructured":"Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: k-Mismatch with don\u2019t cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 151\u2013162. Springer, Heidelberg (2007)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-75530-2_12","volume-title":"String Processing and Information Retrieval","author":"R Clifford","year":"2007","unstructured":"Clifford, R., Porat, E.: A Filtering algorithm for k-mismatch with don\u2019t cares. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 130\u2013136. Springer, Heidelberg (2007)"},{"key":"1_CR19","unstructured":"Cole, R., Hariharan, R.: Randomized swap matching in $$o(m \\log m \\log |\\sigma |)$$ time. Technical report TR1999-789, New York University, Courant Institute, September 1999"},{"key":"1_CR20","unstructured":"Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: A faster implementation of the goemans-williamson clustering algorithm. In: Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 17\u201325 (2001)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-75530-2_14","volume-title":"String Processing and Information Retrieval","author":"Y Dombb","year":"2007","unstructured":"Dombb, Y., Lipsky, O., Porat, B., Porat, E., Tsur, A.: Approximate swap and mismatch edit distance. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 149\u2013163. Springer, Heidelberg (2007)"},{"issue":"8","key":"1_CR22","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/71.605766","volume":"8","author":"J Duato","year":"1997","unstructured":"Duato, J.: A theory of fault-tolerant routing in wormhole networks. IEEE Trans. Parallel Distrib. Syst. 8(8), 790\u2013802 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.2307\/2318261","volume":"82","author":"H Dweighter","year":"1975","unstructured":"Dweighter, H.: Problem e2569. Am. Math. Mon. 82, 1010 (1975)","journal-title":"Am. Math. Mon."},{"key":"1_CR24","first-page":"1","volume":"18","author":"JA Gallian","year":"2011","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electronic Journal of Combinatorics 18, 1\u2013219 (2011)","journal-title":"Electronic Journal of Combinatorics"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"WH Gates","year":"1979","unstructured":"Gates, W.H., Papadimittiou, C.H.: Bounds for sorting by prefix reversal. Discrete Math. 27, 47\u201357 (1979)","journal-title":"Discrete Math."},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1997.0874","volume":"25","author":"MH Heydari","year":"1997","unstructured":"Heydari, M.H., Sudborough, I.H.: On the diameter of the pancake network. J. Algorithms 25(1), 67\u201394 (1997)","journal-title":"J. Algorithms"},{"issue":"4","key":"1_CR27","doi-asserted-by":"publisher","first-page":"397","DOI":"10.2307\/2369492","volume":"2","author":"WW Johnson","year":"1879","unstructured":"Johnson, W.W., Woolsay, W.E.: Notes on the \u201815 puzzle\u2019. Am. J. Math. 2(4), 397\u2013404 (1879)","journal-title":"Am. J. Math."},{"key":"1_CR28","unstructured":"Kantabutra, S.: The complexity of label relocation problems on graphs. In: Proceedings of 8th Asian Symposium of Computer Mathematics, National University of Singapore (2007)"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-89097-3_22","volume-title":"String Processing and Information Retrieval","author":"O Kapah","year":"2008","unstructured":"Kapah, O., Landau, G.M., Levy, A., Oz, N.: Interchange rearrangement: the element-cost model. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 224\u2013235. Springer, Heidelberg (2008)"},{"key":"1_CR30","unstructured":"Kim, D.K., Park, K.: String matching in hypertext. In: Proceedings of 6th Symposium on Combinatorial Pattern Matching (CPM 1995) (1995)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/978-3-540-77120-3_75","volume-title":"Algorithms and Computation","author":"O Lipsky","year":"2007","unstructured":"Lipsky, O., Porat, B., Porat, E., Shalom, B.R., Tzur, A.: Approximate string matching with swap and mismatch. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 869\u2013880. Springer, Heidelberg (2007)"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Manber, U., Wu, S.: Approximate string matching with arbitrary cost for text and hypertext. In: Proceedings International Workshop on Structural and Syntactic Pattern Recognition, pp. 22\u201333 (1992)","DOI":"10.1142\/9789812797919_0002"},{"key":"1_CR33","volume-title":"A treatise of the thoery of determinants with graduated sets of exercises","author":"T Muir","year":"1882","unstructured":"Muir, T.: A treatise of the thoery of determinants with graduated sets of exercises. Macmillan and Co., London (1882)"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-60044-2_50","volume-title":"Combinatorial Pattern Matching","author":"S Muthukrishnan","year":"1995","unstructured":"Muthukrishnan, S.: New results and open problems related to non-standard stringology. In: Galil, Zvi, Ukkonen, Esko (eds.) CPM 1995. LNCS, vol. 937, pp. 298\u2013317. Springer, Heidelberg (1995)"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/S0304-3975(99)00333-3","volume":"237","author":"G Navarro","year":"2000","unstructured":"Navarro, G.: Improved approximate pattern matching on hypertext. Theoret. Comput. Sci. 237, 455\u2013463 (2000)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T16:58:26Z","timestamp":1748451506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}