{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:53Z","timestamp":1740122453496,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T00:00:00Z","timestamp":1605657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T00:00:00Z","timestamp":1605657600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2015\/11937-9","2017\/12646-3"],"award-info":[{"award-number":["2015\/11937-9","2017\/12646-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2017\/16246-0"],"award-info":[{"award-number":["2017\/16246-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"crossref","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["400487\/2016-0","425340\/2016-3"],"award-info":[{"award-number":["400487\/2016-0","425340\/2016-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["131182\/2017-0","304380\/2018-0"],"award-info":[{"award-number":["131182\/2017-0","304380\/2018-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10878-020-00673-2","type":"journal-article","created":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T05:05:30Z","timestamp":1605675930000},"page":"579-602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Length-weighted $$\\lambda $$-rearrangement distance"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro Oliveira","family":"Alexandrino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5643-4527","authenticated-orcid":false,"given":"Guilherme Henrique Santos","family":"Miranda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0602-6298","authenticated-orcid":false,"given":"Carla Negri","family":"Lintzmayer","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":[[2020,11,18]]},"reference":[{"key":"673_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-91938-6_5","volume-title":"Algorithms for computational biology","author":"AO Alexandrino","year":"2018","unstructured":"Alexandrino AO, Lintzmayer CN, Dias Z (2018) Approximation algorithms for sorting permutations by fragmentation-weighted operations. In: Jansson J, Mart\u00edn-Vide C, Vega-Rodr\u00edguez M (eds) Algorithms for computational biology, vol 10849. Springer, Heidelberg, pp 53\u201364"},{"key":"673_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.entcs.2019.08.004","volume":"346","author":"AO Alexandrino","year":"2019","unstructured":"Alexandrino AO, Miranda GHS, Lintzmayer CN, Dias Z (2019) Approximation algorithms for sorting permutations by length-weighted short rearrangements. Electron Notes Theor Comput Sci 346:29\u201340","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"2","key":"673_CR3","doi-asserted-by":"publisher","first-page":"2050006.1","DOI":"10.1142\/S0219720020500067","volume":"18","author":"AO Alexandrino","year":"2020","unstructured":"Alexandrino AO, Lintzmayer CN, Dias Z (2020) Sorting permutations by fragmentation-weighted operations. J Bioinform Comput Biol 18(2):2050006.1\u20132050006.31","journal-title":"J Bioinform Comput Biol"},{"issue":"5","key":"673_CR4","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1089\/cmb.2007.R006","volume":"14","author":"M Bader","year":"2007","unstructured":"Bader M, Ohlebusch E (2007) Sorting by weighted reversals, transpositions, and inverted transpositions. J Comput Biol 14(5):615\u2013636","journal-title":"J Comput Biol"},{"issue":"5","key":"673_CR5","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.jcss.2007.08.008","volume":"74","author":"MA Bender","year":"2008","unstructured":"Bender MA, Ge D, He S, Hu H, Pinter RY, Skiena SS, Swidan F (2008) Improved bounds on sorting by length-weighted reversals. J Comput Syst Sci 74(5):744\u2013774","journal-title":"J Comput Syst Sci"},{"key":"673_CR6","unstructured":"Berman P, Hannenhalli S, Karpinski M (2002) 1.375-Approximation algorithm for sorting by reversals. In M\u00f6hring R, Raman R (ed) Proceedings of the 10th annual European symposium on algorithms (ESA\u20192002), volume 2461 of lecture notes in computer science. Springer, Heidelberg, pp 200\u2013210"},{"issue":"1","key":"673_CR7","doi-asserted-by":"publisher","first-page":"GC11","DOI":"10.1016\/0378-1119(95)00878-0","volume":"172","author":"M Blanchette","year":"1996","unstructured":"Blanchette M, Kunisawa T, Sankoff D (1996) Parametric genome rearrangement. Gene 172(1):GC11\u2013GC17","journal-title":"Gene"},{"issue":"3","key":"673_CR8","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 Discrete Math 26(3):1148\u20131180","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"673_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S089548019731994X","volume":"12","author":"A Caprara","year":"1999","unstructured":"Caprara A (1999) Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J Discrete Math 12(1):91\u2013110","journal-title":"SIAM J Discrete Math"},{"issue":"3","key":"673_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10878-010-9369-8","volume":"25","author":"X Chen","year":"2013","unstructured":"Chen X (2013) On sorting unsigned permutations by double-cut-and-joins. J Combin Optim 25(3):339\u2013351","journal-title":"J Combin Optim"},{"key":"673_CR11","unstructured":"Dias UM (2012) Problemas de Compara\u00e7\u00e3o de Genomas. PhD thesis, Institute of Computing, University of Campinas. (In Portuguese)"},{"issue":"4","key":"673_CR12","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 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Trans Comput Biol Bioinform 3(4):369\u2013379","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"1","key":"673_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/S0304-3975(01)00338-3","volume":"289","author":"N Eriksen","year":"2002","unstructured":"Eriksen N (2002) (1+$$\\epsilon $$)-approximation of sorting by reversals and transpositions. Theor Comput Sci 289(1):517\u2013529","journal-title":"Theor Comput Sci"},{"issue":"1","key":"673_CR14","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 (2015) Sorting signed permutations by short operations. Algorithms Mol Biol 10(1):1\u201317","journal-title":"Algorithms Mol Biol"},{"issue":"1","key":"673_CR15","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","journal-title":"J ACM"},{"issue":"5","key":"673_CR16","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1089\/106652703322539097","volume":"10","author":"LS Heath","year":"2003","unstructured":"Heath LS, Vergara JPC (2003) Sorting by short swaps. J Comput Biol 10(5):775\u2013789","journal-title":"J Comput Biol"},{"issue":"2\u20133","key":"673_CR17","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 (1985) The complexity of finding minimum-length generator sequences. Theor Comput Sci 36(2\u20133):265\u2013289","journal-title":"Theor Comput Sci"},{"key":"673_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.03.019","volume":"437","author":"H Jiang","year":"2012","unstructured":"Jiang H, Zhu D, Zhu B (2012) A (1+$$\\epsilon $$)-approximation algorithm for sorting by short block-moves. Theor Comput Sci 437:1\u20138","journal-title":"Theor Comput Sci"},{"key":"673_CR19","doi-asserted-by":"crossref","unstructured":"Jiang H, Feng H, Zhu D (2014) An 5\/4-approximation algorithm for sorting permutations by short block moves. In Ahn H, Shin C (ed) Proceedings of the 25th international symposium on algorithms and computation (ISAAC\u20192014), volume 8889 of lecture notes in computer science. Springer, Heidelberg, pp 491\u2013503","DOI":"10.1007\/978-3-319-13075-0_39"},{"issue":"1","key":"673_CR20","doi-asserted-by":"publisher","first-page":"i190","DOI":"10.1093\/bioinformatics\/btg1025","volume":"19","author":"J-F Lefebvre","year":"2003","unstructured":"Lefebvre J-F, El-Mabrouk N, Tillier ERM, Sankoff D (2003) Detection and validation of single gene inversions. Bioinformatics 19(1):i190\u2013i196","journal-title":"Bioinformatics"},{"key":"673_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2015.05.039","volume":"593","author":"CN Lintzmayer","year":"2015","unstructured":"Lintzmayer CN, Fertin G, Dias Z (2015) Approximation algorithms for sorting by length-weighted prefix and suffix operations. Theor Comput Sci 593:26\u201341","journal-title":"Theor Comput Sci"},{"key":"673_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2018.01.012","volume":"715","author":"CN Lintzmayer","year":"2018","unstructured":"Lintzmayer CN, Fertin G, Dias Z (2018) Sorting permutations and binary strings by length-weighted rearrangements. Theor Comput Sci 715:35\u201359","journal-title":"Theor Comput Sci"},{"issue":"2","key":"673_CR23","first-page":"98","volume":"25","author":"GHS Miranda","year":"2019","unstructured":"Miranda GHS, Lintzmayer CN, Dias Z (2019) Sorting permutations by $$\\lambda $$-operations. J Univ Comput Sci 25(2):98\u2013121","journal-title":"J Univ Comput Sci"},{"issue":"2","key":"673_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/S1672-0229(05)03016-0","volume":"3","author":"TC Nguyen","year":"2005","unstructured":"Nguyen TC, Ngo HT, Nguyen NB (2005) Sorting by restricted-length-weighted reversals. Genomics Proteomics Bioinform 3(2):120\u2013127","journal-title":"Genomics Proteomics Bioinform"},{"issue":"11","key":"673_CR25","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1089\/cmb.2019.0078","volume":"26","author":"AR Oliveira","year":"2019","unstructured":"Oliveira AR, Brito KL, Dias U, Dias Z (2019) On the complexity of sorting by reversals and transpositions problems. J Comput Biol 26(11):1223\u20131229","journal-title":"J Comput Biol"},{"key":"673_CR26","first-page":"103","volume":"13","author":"RY Pinter","year":"2002","unstructured":"Pinter RY, Skiena S (2002) Genomic sorting with length-weighted reversals. Genome Inform 13:103\u2013111","journal-title":"Genome Inform"},{"issue":"3","key":"673_CR27","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 (2008) An approximation algorithm for sorting by reversals and transpositions. J Discrete Algorithms 6(3):449\u2013457","journal-title":"J Discrete Algorithms"},{"key":"673_CR28","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-27801-6_3","volume-title":"Combinatorial pattern matching","author":"F Swidan","year":"2004","unstructured":"Swidan F, Bender MA, Ge D, He S, Hu H, Pinter RY (2004) Sorting by length-weighted reversals: dealing with signs and circularity. In: Sahinalp S, Muthukrishnan S, Dogrusoz U (eds) Combinatorial pattern matching, vol 3109. Lecture notes in computer science. Springer, Heidelberg, pp 32\u201346"},{"key":"673_CR29","unstructured":"Vergara JPC (1998) Sorting by bounded permutations. PhD thesis, Virginia Polytechnic Institute and State University"},{"key":"673_CR30","unstructured":"Walter MEMT, Dias Z, Meidanis J (1998) Reversal and transposition distance of linear chromosomes. In Proceedings of the 5th international symposium on string processing and information retrieval (SPIRE\u20191998), Los Alamitos, CA. IEEE Computer Society, pp 96\u2013102"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00673-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00673-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00673-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T08:34:42Z","timestamp":1615365282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00673-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,18]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["673"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00673-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,11,18]]},"assertion":[{"value":"6 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}