{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:23:03Z","timestamp":1759134183238,"version":"3.37.3"},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100013986","name":"UK Government","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100013986","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1016\/j.jda.2015.03.009","type":"journal-article","created":{"date-parts":[[2015,4,6]],"date-time":"2015-04-06T05:14:57Z","timestamp":1428297297000},"page":"160-170","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Prefix and suffix transreversals on binary and ternary strings"],"prefix":"10.1016","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0166-2992","authenticated-orcid":false,"given":"Md.","family":"Khaledur Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sohel Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jda.2015.03.009_br0030","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TCBB.2005.48","article-title":"Assignment of orthologous genes via genome rearrangement","volume":"2","author":"Chen","year":"2005","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"10.1016\/j.jda.2015.03.009_br0040","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/S0895480197331995","article-title":"Sorting strings by reversals and by transpositions","volume":"14","author":"Christie","year":"2001","journal-title":"SIAM J. Discrete Math."},{"issue":"8","key":"10.1016\/j.jda.2015.03.009_br0020","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.ipl.2013.01.017","article-title":"Prefix transpositions on binary and ternary strings","volume":"113","author":"Dutta","year":"2013","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"10.1016\/j.jda.2015.03.009_br0050","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","article-title":"Sorting a bridge hand","volume":"241","author":"Eriksson","year":"2001","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.jda.2015.03.009_br0060","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1137\/060664252","article-title":"Prefix reversals on binary and ternary strings","volume":"21","author":"Hurkens","year":"2007","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jda.2015.03.009_br0010","series-title":"Proceedings of LATIN","article-title":"Sorting permutations by prefix and suffix versions of reversals and transpositions","author":"Lintzmayer","year":"2014"},{"key":"10.1016\/j.jda.2015.03.009_br0070","article-title":"Reversals and transpositions over finite alphabets","author":"Radcliffe","year":"2006","journal-title":"SIAM J. Discrete Math."}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866715000520?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866715000520?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T21:10:40Z","timestamp":1561929040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866715000520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":7,"alternative-id":["S1570866715000520"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2015.03.009","relation":{},"ISSN":["1570-8667"],"issn-type":[{"type":"print","value":"1570-8667"}],"subject":[],"published":{"date-parts":[[2015,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Prefix and suffix transreversals on binary and ternary strings","name":"articletitle","label":"Article Title"},{"value":"Journal of Discrete Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jda.2015.03.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}