{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:52Z","timestamp":1740122452644,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e1 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2015\/11937-9","2019\/27331-3"],"award-info":[{"award-number":["2015\/11937-9","2019\/27331-3"]}],"id":[{"id":"10.13039\/501100001807","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","202292\/2020-7"],"award-info":[{"award-number":["425340\/2016-3","202292\/2020-7"]}],"id":[{"id":"10.13039\/501100003593","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":["Finance Code 001","2013\/08293-7"],"award-info":[{"award-number":["Finance Code 001","2013\/08293-7"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10878-022-00937-z","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T21:03:01Z","timestamp":1668718981000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for sorting by k-cuts on signed permutations"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre Rodrigues","family":"Oliveira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro Oliveira","family":"Alexandrino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1534-2682","authenticated-orcid":false,"given":"G\u00e9raldine","family":"Jean","sequence":"additional","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":[[2022,11,17]]},"reference":[{"issue":"8","key":"937_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1089\/cmb.2008.0080","volume":"15","author":"MA Alekseyev","year":"2008","unstructured":"Alekseyev MA (2008) Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes. J Comput Biol 15(8):1117\u20131131. https:\/\/doi.org\/10.1089\/cmb.2008.0080","journal-title":"J Comput Biol"},{"issue":"2\u20133","key":"937_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2008.01.013","volume":"395","author":"MA Alekseyev","year":"2008","unstructured":"Alekseyev MA, Pevzner PA (2008) Multi-break rearrangements and chromosomal evolution. Theoret Comp Sci 395(2\u20133):193\u2013202. https:\/\/doi.org\/10.1016\/j.tcs.2008.01.013","journal-title":"Theoret Comp Sci"},{"issue":"9","key":"937_CR3","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.3897\/jucs.2020.057","volume":"26","author":"AO Alexandrino","year":"2020","unstructured":"Alexandrino AO, Oliveira AR, Dias U, Dias Z (2020) On the complexity of some variations of sorting by transpositions. J Univer Comp Sci 26(9):1076\u20131094. https:\/\/doi.org\/10.3897\/jucs.2020.057","journal-title":"J Univer Comp Sci"},{"issue":"2","key":"937_CR4","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V Bafna","year":"1998","unstructured":"Bafna V, Pevzner PA (1998) Sorting by transpositions. SIAM J Discr Math 11(2):224\u2013240. https:\/\/doi.org\/10.1137\/S089548019528280X","journal-title":"SIAM J Discr Math"},{"issue":"6","key":"937_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3390\/a14060169","volume":"14","author":"L Bulteau","year":"2021","unstructured":"Bulteau L, Fertin G, Jean G, Komusiewicz C (2021) Sorting by multi-cut rearrangements. Algorithms 14(6):169. https:\/\/doi.org\/10.3390\/a14060169","journal-title":"Algorithms"},{"issue":"3","key":"937_CR6","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L Bulteau","year":"2012","unstructured":"Bulteau L, Fertin G, Rusu I (2012) Sorting by transpositions is difficult. SIAM J Discr Math 26(3):1148\u20131180. https:\/\/doi.org\/10.1137\/110851390","journal-title":"SIAM J Discr Math"},{"issue":"4","key":"937_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"DA Christie","year":"1996","unstructured":"Christie DA (1996) Sorting permutations by block-interchanges. Infor Process Lett 60(4):165\u2013169. https:\/\/doi.org\/10.1016\/S0020-0190(96)00155-X","journal-title":"Infor Process Lett"},{"issue":"4","key":"937_CR8","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 (2006) A 1375-approximation algorithm for sorting by transpositions. IEEE\/ACM Trans Comput Biol Bioinform 3(4):369\u2013379. https:\/\/doi.org\/10.1109\/TCBB.2006.44","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"937_CR9","doi-asserted-by":"publisher","unstructured":"Fertin G, Labarre A, Rusu I, Tannier \u00c9, Vialette S (2009) Combinatorics of genome rearrangements. computational molecular biology. The MIT Press, London, England. https:\/\/doi.org\/10.7551\/mitpress\/9780262062824.001.0001","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"issue":"1","key":"937_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner PA (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM 46(1):1\u201327. https:\/\/doi.org\/10.1145\/300515.300516","journal-title":"J ACM"},{"issue":"11","key":"937_CR11","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1038\/nm.2988","volume":"18","author":"AJ Holland","year":"2012","unstructured":"Holland AJ, Cleveland DW (2012) Chromoanagenesis and cancer: mechanisms and consequences of localized, complex chromosomal rearrangements. Nat Med 18(11):1630\u20131638. https:\/\/doi.org\/10.1038\/nm.2988","journal-title":"Nat Med"},{"issue":"1\u20132","key":"937_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0304-3975(00)00038-4","volume":"259","author":"GH Lin","year":"2001","unstructured":"Lin GH, Xue G (2001) Signed genome rearrangement by reversals and transpositions: models and approximations. Theoret Comp Sci 259(1\u20132):513\u2013531. https:\/\/doi.org\/10.1016\/S0304-3975(00)00038-4","journal-title":"Theoret Comp Sci"},{"key":"937_CR13","doi-asserted-by":"publisher","unstructured":"Oliveira A.R, Alexandrino A.O, Jean G, Fertin G, Dias U, Dias Z (2022) Sorting by k-cuts on signed permutations. In: Comparative genomics. RECOMB-CG 2022, La Jolla, CA, USA. Lecture notes in computer science. vol. 13234, pp. 189\u2013204. Springer. https:\/\/doi.org\/10.1007\/978-3-031-06220-9_11","DOI":"10.1007\/978-3-031-06220-9_11"},{"issue":"1","key":"937_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13039-020-0470-0","volume":"13","author":"F Pellestor","year":"2020","unstructured":"Pellestor F, Gatinois V (2020) Chromoanagenesis: a piece of the macroevolution scenario. Mole Cytogen 13(1):1\u20139. https:\/\/doi.org\/10.1186\/s13039-020-0470-0","journal-title":"Mole Cytogen"},{"issue":"16","key":"937_CR15","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 (2005) Efficient sorting of genomic permutations by translocation inversion and block interchange. Bioinformatics 21(16):3340\u20133346. https:\/\/doi.org\/10.1093\/bioinformatics\/bti535","journal-title":"Bioinformatics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00937-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00937-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00937-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:44:26Z","timestamp":1675496666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00937-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,17]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["937"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00937-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,11,17]]},"assertion":[{"value":"30 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}