{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:19:16Z","timestamp":1725520756582},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540890966"},{"type":"electronic","value":"9783540890973"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89097-3_22","type":"book-chapter","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T11:16:29Z","timestamp":1226315789000},"page":"224-235","source":"Crossref","is-referenced-by-count":4,"title":["Interchange Rearrangement: The Element-Cost Model"],"prefix":"10.1007","author":[{"given":"Oren","family":"Kapah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitsan","family":"Oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"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: Proc. of the 17th annual ACM-SIAM Symposium on Discrete Algorithm (SODA), pp. 1221\u20131229 (2006)","key":"22_CR1","DOI":"10.1145\/1109557.1109692"},{"key":"22_CR2","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 \u21131 and \u2113\u2009\u221e\u2009. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 39\u201349. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Proc. of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 118\u2013130 (2008)","key":"22_CR3","DOI":"10.1007\/978-3-540-69068-9_13"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-75520-3_11","volume-title":"Algorithms \u2013 ESA 2007","author":"A. Amir","year":"2007","unstructured":"Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 99\u2013110. Springer, Heidelberg (2007)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-78773-0_5","volume-title":"LATIN 2008: Theoretical Informatics","author":"S. Angelov","year":"2008","unstructured":"Angelov, S., Kunal, K., McGregor, A.: Sorting and selection with random costs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 48\u201359. Springer, Heidelberg (2008)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics\u00a011, 224\u2013240 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"unstructured":"Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. of the 15th annual ACM-SIAM Symposium on Discrete Algorithm (SODA), pp. 919\u2013928 (2004)","key":"22_CR7"},{"doi-asserted-by":"crossref","unstructured":"Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM), vol.\u00a01075, pp. 168\u2013185 (1996)","key":"22_CR8","DOI":"10.1007\/3-540-61258-0_14"},{"doi-asserted-by":"crossref","unstructured":"Carpara, A.: Sorting by reversals is difficult. In: Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB), pp. 75\u201383 (1997)","key":"22_CR9","DOI":"10.1145\/267521.267531"},{"key":"22_CR10","first-page":"527","volume":"34","author":"A. Cayley","year":"1849","unstructured":"Cayley, A.: Note on the theory of permutations. Philosophical Magazine\u00a034, 527\u2013529 (1849)","journal-title":"Philosophical Magazine"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting by block-interchanges. Information Processing Letters\u00a060, 165\u2013169 (1996)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A.: Sorting and selection with structured costs. In: Proc. of the 42nd Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013425 (2001)","key":"22_CR12","DOI":"10.1109\/SFCS.2001.959916"},{"key":"22_CR13","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)"},{"issue":"1-3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(98)00072-9","volume":"88","author":"L.S. Heath","year":"1998","unstructured":"Heath, L.S., Vergara, J.P.C.: Sorting by bounded block-moves. Discrete Applied Mathematics\u00a088(1-3), 181\u2013206 (1998)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"22_CR15","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1089\/106652703322539097","volume":"10","author":"L.S. Heath","year":"2003","unstructured":"Heath, L.S., Vergara, J.P.C.: Sorting by short swaps. Journal of Computational Biology\u00a010(5), 775\u2013789 (2003)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89097-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T06:33:16Z","timestamp":1557901996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89097-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540890966","9783540890973"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89097-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}