{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:48:51Z","timestamp":1779896931065,"version":"3.53.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/s0020-0190(96)00155-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:13:10Z","timestamp":1051132390000},"page":"165-169","source":"Crossref","is-referenced-by-count":114,"title":["Sorting permutations by block-interchanges"],"prefix":"10.1016","volume":"60","author":[{"given":"David A.","family":"Christie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(96)00155-X_BIB1","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0097-3165(87)90022-7","article-title":"Sorting by insertion of leading elements","volume":"45","author":"Aigner","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0020-0190(96)00155-X_BIB2","series-title":"Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"614","article-title":"Sorting by transpositions","author":"Bafna","year":"1995"},{"key":"10.1016\/S0020-0190(96)00155-X_BIB3","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0097539793250627","article-title":"Genome rearrangements and sorting by reversals","volume":"25","author":"Bafna","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(96)00155-X_BIB4","series-title":"Sorting by reversals is difficult","author":"Caprara","year":"1996"},{"key":"10.1016\/S0020-0190(96)00155-X_BIB5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","article-title":"The minimum-length generator sequence problem is NP-hard","volume":"2","author":"Even","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(96)00155-X_BIB6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","article-title":"Bounds for sorting by prefix reversal","volume":"27","author":"Gates","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(96)00155-X_BIB7","series-title":"Proc. 6th Ann. Symp. on Combinatorial Pattern Matching (CPM'95)","first-page":"162","article-title":"Polynomial algorithm for computing translocation distance","volume":"937","author":"Hannenhalli","year":"1995"},{"key":"10.1016\/S0020-0190(96)00155-X_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","article-title":"The complexity of finding minimum-length generator sequences","volume":"36","author":"Jerrum","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(96)00155-X_BIB9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01188586","article-title":"Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(96)00155-X_BIB10","series-title":"Proc. 6th ACM-SIAM Symp. on Discrete Algorithms","first-page":"604","article-title":"Of mice and men: Algorithms for evolutionary distances between genomes with translocation","author":"Kececioglu","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909600155X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909600155X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:53Z","timestamp":1556058293000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909600155X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S002001909600155X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(96)00155-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}