{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:32Z","timestamp":1740144512145,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T00:00:00Z","timestamp":1532563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/08293-7","2015\/11937-9"],"award-info":[{"award-number":["2013\/08293-7","2015\/11937-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["831\/15 (CAPES\/COFECUB)"],"award-info":[{"award-number":["831\/15 (CAPES\/COFECUB)"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["425340\/2016-3","400487\/2016-0"],"award-info":[{"award-number":["425340\/2016-3","400487\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s13015-018-0131-6","type":"journal-article","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T23:46:45Z","timestamp":1532562405000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sorting signed circular permutations by super short operations"],"prefix":"10.1186","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre R.","family":"Oliveira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8251-2012","authenticated-orcid":false,"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4763-3046","authenticated-orcid":false,"given":"Ulisses","family":"Dias","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3333-6822","authenticated-orcid":false,"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"key":"131_CR1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of genome rearrangements. Computational molecular biology","author":"G Fertin","year":"2009","unstructured":"Fertin G, Labarre A, Rusu I, Tannier \u00c9, Vialette S. Combinatorics of genome rearrangements. Computational molecular biology. London: The MIT Press; 2009."},{"issue":"1","key":"131_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner PA. Transforming cabbage into turnip: polynomial algorithm for Sorting Signed Permutations by reversals. J ACM. 1999;46(1):1\u201327.","journal-title":"J ACM"},{"issue":"1","key":"131_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S089548019731994X","volume":"12","author":"A Caprara","year":"1999","unstructured":"Caprara A. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J Discrete Math. 1999;12(1):91\u2013110.","journal-title":"SIAM J Discrete Math"},{"key":"131_CR4","first-page":"200","volume-title":"Algorithm for sorting by reversals","author":"P Berman","year":"2002","unstructured":"Berman P, Hannenhalli S, Karpinski M. Proceedings of the 10th annual European symposium on algorithms (ESA\u20192002). Lecture Notes in Computer Science. In: M\u00f6hring R, Raman R, editors. Algorithm for sorting by reversals, vol. 2461. Berlin Heidelberg: Springer; 2002. p. 200\u201310."},{"issue":"3","key":"131_CR5","first-page":"1148","volume":"26","author":"L Bulteau","year":"2012","unstructured":"Bulteau L, Fertin G, Rusu I. Sorting by transpositions is difficult. SIAM J Comput. 2012;26(3):1148\u201380.","journal-title":"SIAM J Comput"},{"issue":"4","key":"131_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TCBB.2006.44","volume":"3","author":"I Elias","year":"2006","unstructured":"Elias I, Hartman T. A 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Trans Comput Biol Bioinform. 2006;3(4):369\u201379.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"131_CR7","unstructured":"Walter MEMT, Dias Z, Meidanis J. Reversal and transposition distance of linear chromosomes. In: Proceedings of the 5th international symposium on string processing and information retrieval (SPIRE\u20191998). Los Alamitos: IEEE Computer Society; 1998. p. 96\u2013102."},{"issue":"3","key":"131_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.jda.2007.09.002","volume":"6","author":"A Rahman","year":"2008","unstructured":"Rahman A, Shatabda S, Hasan M. An approximation algorithm for sorting by reversals and transpositions. J Discrete Algorithm. 2008;6(3):449\u201357.","journal-title":"J Discrete Algorithm"},{"issue":"3","key":"131_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10878-010-9369-8","volume":"25","author":"X Chen","year":"2013","unstructured":"Chen X. On Sorting Unsigned Permutations by double-cut-and-joins. J Comb Optim. 2013;25(3):339\u201351.","journal-title":"J Comb Optim"},{"issue":"1","key":"131_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0378-1119(95)00878-0","volume":"172","author":"M Blanchette","year":"1996","unstructured":"Blanchette M, Kunisawa T, Sankoff D. Parametric genome rearrangement. Gene. 1996;172(1):11\u20137.","journal-title":"Gene"},{"issue":"7","key":"131_CR11","doi-asserted-by":"publisher","first-page":"1000128","DOI":"10.1371\/journal.pgen.1000128","volume":"4","author":"AE Darling","year":"2008","unstructured":"Darling AE, Mikl\u00f3s I, Ragan MA. Dynamics of genome rearrangement in bacterial populations. PLoS Genet. 2008;4(7):1000128.","journal-title":"PLoS Genetics"},{"key":"131_CR12","doi-asserted-by":"crossref","unstructured":"Seoighe C, Federspiel N, Jones T, Hansen N, Bivolarovic V, Surzycki R, Tamse R, Komp C, Huizar L, Davis RW, Scherer S, Tait E, Shaw DJ, Harris D, Murphy L, Oliver K, Taylor K, Rajandream M-A, Barrell BG, Wolfe KH. Prevalence of small inversions in yeast gene order evolution. In: Proceedings of the national academy of sciences of the United States of America, vol. 97, no. 26; 2000. p. 14433\u20137.","DOI":"10.1073\/pnas.240462997"},{"issue":"2\u20133","key":"131_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"MR Jerrum","year":"1985","unstructured":"Jerrum MR. The complexity of finding minimum-length generator sequences. Theor Comput Sci. 1985;36(2\u20133):265\u201389.","journal-title":"Theor Comput Sci"},{"issue":"3","key":"131_CR14","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TCBB.2016.2515594","volume":"14","author":"GR Galv\u00e3o","year":"2017","unstructured":"Galv\u00e3o GR, Baudet C, Dias Z. Sorting circular permutations by super short reversals. IEEE\/ACM Trans Comput Biol Bioinform. 2017;14(3):620\u201333.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"131_CR15","volume-title":"The art of computer programming: fundamental algorithms","author":"DE Knuth","year":"1973","unstructured":"Knuth DE. The art of computer programming: fundamental algorithms. Reading: Addison-Wesley; 1973."},{"issue":"1","key":"131_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-015-0040-x","volume":"10","author":"GR Galv\u00e3o","year":"2015","unstructured":"Galv\u00e3o GR, Lee O, Dias Z. Sorting Signed Permutations by short operations. Algorithms Mol Biol. 2015;10(1):1\u201317.","journal-title":"Algorithms Mol Biol"},{"issue":"16","key":"131_CR17","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos S, Attie O, Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005;21(16):3340\u20136.","journal-title":"Bioinformatics"},{"issue":"16","key":"131_CR18","first-page":"1","volume":"12","author":"G Fertin","year":"2017","unstructured":"Fertin G, Jean G, Tannier E. Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithms Mol Biol. 2017;12(16):1\u201311.","journal-title":"Algorithms Mol Biol"},{"issue":"S\u201314","key":"131_CR19","first-page":"225","volume":"17","author":"L Bulteau","year":"2016","unstructured":"Bulteau L, Fertin G, Tannier E. Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. 2016;17(S\u201314):225\u201331.","journal-title":"BMC Bioinform"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-018-0131-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-018-0131-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-018-0131-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T03:37:25Z","timestamp":1568950645000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-018-0131-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,26]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1186\/s13015-018-0131-6","relation":{},"ISSN":["1748-7188"],"issn-type":[{"type":"electronic","value":"1748-7188"}],"subject":[],"published":{"date-parts":[[2018,7,26]]},"assertion":[{"value":"22 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}