{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T17:18:17Z","timestamp":1660324697437},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"Raymond and Beverly Sackler chair in Bioinformatics"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["802\/08"],"id":[{"id":"10.13039\/501100003977","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":[[2011,12]]},"DOI":"10.1016\/j.jda.2011.04.003","type":"journal-article","created":{"date-parts":[[2011,4,15]],"date-time":"2011-04-15T19:22:29Z","timestamp":1302895349000},"page":"344-357","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["An O<\/mml:mi>(<\/mml:mo>n<\/mml:mi>3<\/mml:mn>\/<\/mml:mo>2<\/mml:mn><\/mml:mrow><\/mml:msup>log<\/mml:mi>(<\/mml:mo>n<\/mml:mi>)<\/mml:mo><\/mml:mrow><\/mml:msqrt>)<\/mml:mo><\/mml:math> algorithm for sorting by reciprocal translocations"],"prefix":"10.1016","volume":"9","author":[{"given":"Michal","family":"Ozery-Flato","sequence":"first","affiliation":[]},{"given":"Ron","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.jda.2011.04.003_br0010","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1089\/106652701753216503","article-title":"A linear-time algorithm for computing inversion distance between signed permutations with an experimental study","volume":"8","author":"Bader","year":"2001","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"10.1016\/j.jda.2011.04.003_br0020","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.dam.2004.04.010","article-title":"A very elementary presentation of the Hannenhalli\u2013Pevzner theory","volume":"146","author":"Bergeron","year":"2005","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.jda.2011.04.003_br0030","series-title":"Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM)","first-page":"388","article-title":"Reversal distance without hurdles and fortresses","volume":"vol. 3109","author":"Bergeron","year":"2004"},{"issue":"2","key":"10.1016\/j.jda.2011.04.003_br0040","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1089\/cmb.2006.13.567","article-title":"On sorting by translocations","volume":"13","author":"Bergeron","year":"2006","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.jda.2011.04.003_br0050","series-title":"Proceedings of the 7th Annual Symposium Combinatorial Pattern Matching (CPM)","first-page":"168","article-title":"Fast sorting by reversal","volume":"vol. 1075","author":"Berman","year":"1996"},{"key":"10.1016\/j.jda.2011.04.003_br0060","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(96)00061-3","article-title":"Polynomial algorithm for computing translocation distance between genomes","volume":"71","author":"Hannenhalli","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.jda.2011.04.003_br0070","series-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"581","article-title":"Transforming men into mice (polynomial algorithm for genomic distance problems)","author":"Hannenhalli","year":"1995"},{"key":"10.1016\/j.jda.2011.04.003_br0080","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/300515.300516","article-title":"Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals","volume":"46","author":"Hannenhalli","year":"1999","journal-title":"Journal of the ACM"},{"issue":"3","key":"10.1016\/j.jda.2011.04.003_br0090","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1137\/S0097539798334207","article-title":"Faster and simpler algorithm for sorting signed permutations by reversals","volume":"29","author":"Kaplan","year":"2000","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"10.1016\/j.jda.2011.04.003_br0100","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.jcss.2004.12.002","article-title":"Sorting signed permutations by reversals, revisited","volume":"70","author":"Kaplan","year":"2005","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.jda.2011.04.003_br0110","series-title":"Proceedings of the 6th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA)","first-page":"604","article-title":"Of mice and men: Algorithms for evolutionary distances between genomes with translocation","author":"Kececioglu","year":"1995"},{"key":"10.1016\/j.jda.2011.04.003_br0120","series-title":"Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM)","first-page":"323","article-title":"A linear-time algorithm for computing translocation distance between signed genomes","volume":"vol. 3109","author":"Li","year":"2004"},{"key":"10.1016\/j.jda.2011.04.003_br0130","series-title":"Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM)","article-title":"An O(n3\/2log(n)) algorithm for sorting by reciprocal translocations","volume":"vol. 4009","author":"Ozery-Flato","year":"2006"},{"issue":"4","key":"10.1016\/j.jda.2011.04.003_br0140","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1089\/cmb.2007.A003","article-title":"Sorting by translocations via reversals theory","volume":"14","author":"Ozery-Flato","year":"2007","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.jda.2011.04.003_br0150","doi-asserted-by":"crossref","unstructured":"E. Tannier, A. Bergeron, M. Sagot, Advances on sorting by reversals, Discrete Applied Mathematics 155 (6\u20137) 881\u2013888.","DOI":"10.1016\/j.dam.2005.02.033"},{"issue":"3","key":"10.1016\/j.jda.2011.04.003_br0160","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.jcss.2004.12.005","article-title":"An o(n2) algorithm for signed translocation","volume":"70","author":"Wang","year":"2005","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866711000463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866711000463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T16:43:34Z","timestamp":1660322614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866711000463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["S1570866711000463"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2011.04.003","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An algorithm for sorting by reciprocal translocations","name":"articletitle","label":"Article Title"},{"value":"Journal of Discrete Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jda.2011.04.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2011 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}