{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:24:57Z","timestamp":1775031897100,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540438625","type":"print"},{"value":"9783540454526","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_9","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:55:29Z","timestamp":1179280529000},"page":"85-98","source":"Crossref","is-referenced-by-count":36,"title":["Edit Distance with Move Operations"],"prefix":"10.1007","author":[{"given":"Dana","family":"Shapira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James A.","family":"Storer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bafna V. AND Pevzner P.A., Genome rearrangements and sorting by reversals, 34th IEEE Symposium on Foundations of Computer Science, (1993) 148\u2013157","DOI":"10.1109\/SFCS.1993.366872"},{"issue":"2","key":"9_CR2","first-page":"124","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna V. AND Pevzner P.A., Sorting by transpositions, 34th SIAM J. Discrete Math., 11(2), (1998) 124\u2013240","journal-title":"34th SIAM J. Discrete Math."},{"key":"9_CR3","volume-title":"Computers and Intractability, A guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R. AND Johnson D.S., Computers and Intractability, A guide to the Theory of NP-Completeness, Bell Laboratories Murry Hill, NJ, (1979)"},{"key":"9_CR4","volume-title":"Coding and information Theory","author":"R.W. Hamming","year":"1980","unstructured":"Hamming R.W., Coding and information Theory, Englewood Cliffs, NJ, Prentice Hall, (1980)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Hannenhalli S., Polynomial-time Algorithm for Computing Translocation Distance between Genomes CPM, (1996) 162\u2013176","DOI":"10.1007\/3-540-60044-2_41"},{"key":"9_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0029799","volume-title":"Pro. of 4th Ann. Symp. on Combinatorial Pattern Matching","author":"J. Kececioglu","year":"1993","unstructured":"Kececioglu J. AND Sankoff D., Exact and approximation algorithms for the inversion distance between two permutations. Pro. of 4th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science 684, (1993) 87\u2013105"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Liben-Nowell D., On the Structure of Syntenic Distance, CPM, (1999) 50\u201365","DOI":"10.1007\/3-540-48452-3_4"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00268-X","volume":"181","author":"D. Lopresti","year":"1997","unstructured":"Lopresti D. AND Tomkins A., Block Edit Models for Approximate String Matching, Theoretical Computer Science, 181, (1997) 159\u2013179","journal-title":"Theoretical Computer Science"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Muthukrishnan S. AND Sahinalp S.C., Approximate nearest neighbors and sequence comparison with block operations, STOC\u201900, ACM Symposium on Theory of Computing, (2000) 416\u2013424","DOI":"10.1145\/335305.335353"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith T.F. AND Waterman M.S., Identification of common molecular sequences, Journal of Molecular Biology, 147, (1981) 195\u2013197","journal-title":"Journal of Molecular Biology"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Storer J. A., An Introduction to Data Structures and Algorithms, Birkhauser-Springer, (2001)","DOI":"10.1007\/978-1-4612-0075-8"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/357401.357404","volume":"2","author":"W.F. Tichy","year":"1984","unstructured":"Tichy W.F., The string to string correction problem with block moves, ACM Transactions on Computer Systems, 2(4), (1984) 309\u2013321","journal-title":"ACM Transactions on Computer Systems"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:13:08Z","timestamp":1737018788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}