{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T20:51:37Z","timestamp":1775854297423,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319919379","type":"print"},{"value":"9783319919386","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91938-6_7","type":"book-chapter","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:04:12Z","timestamp":1526447052000},"page":"76-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sorting Permutations by Limited-Size Operations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5643-4527","authenticated-orcid":false,"given":"Guilherme Henrique Santos","family":"Miranda","sequence":"first","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":[[2018,5,17]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discret. Math. 11(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45749-6_21","volume-title":"Algorithms \u2014 ESA 2002","author":"P Berman","year":"2002","unstructured":"Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-approximation algorithm for sorting by reversals. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 200\u2013210. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45749-6_21"},{"issue":"3","key":"7_CR3","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. 26(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR4","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. Discret. Math. 12(1), 91\u2013110 (1999)","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"7_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0166-218X(96)00069-8","volume":"71","author":"T Chen","year":"1996","unstructured":"Chen, T., Skiena, S.S.: Sorting with fixed-length reversals. Discret. Appl. Math. 71(1\u20133), 269\u2013295 (1996)","journal-title":"Discret. Appl. Math."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-45735-6_7","volume-title":"String Processing and Information Retrieval","author":"Z Dias","year":"2002","unstructured":"Dias, Z., Meidanis, J.: Sorting by prefix transpositions. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 65\u201376. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45735-6_7"},{"issue":"4","key":"7_CR7","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. Bioinf. 3(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"1","key":"7_CR8","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, G.R., Lee, O., Dias, Z.: Sorting signed permutations by short operations. Algorithms Mol. Biol. 10(1), 1\u201317 (2015)","journal-title":"Algorithms Mol. Biol."},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1089\/106652703322539097","volume":"10","author":"LS Heath","year":"2003","unstructured":"Heath, L.S., Vergara, J.P.C.: Sorting by short swaps. J. Comput. Biol. 10(5), 775\u2013789 (2003)","journal-title":"J. Comput. Biol."},{"issue":"2\u20133","key":"7_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"MR Jerrum","year":"1985","unstructured":"Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theoret. Comput. Sci. 36(2\u20133), 265\u2013289 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-13075-0_39","volume-title":"Algorithms and Computation","author":"H Jiang","year":"2014","unstructured":"Jiang, H., Feng, H., Zhu, D.: An 5\/4-approximation algorithm for sorting permutations by short block moves. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 491\u2013503. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13075-0_39"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"i190","DOI":"10.1093\/bioinformatics\/btg1025","volume":"19","author":"JF Lefebvre","year":"2003","unstructured":"Lefebvre, J.F., El-Mabrouk, N., Tillier, E.R.M., Sankoff, D.: Detection and validation of single gene inversions. Bioinformatics 19(1), i190\u2013i196 (2003)","journal-title":"Bioinformatics"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/B:JOCO.0000031419.12290.2b","volume":"8","author":"G Lin","year":"2004","unstructured":"Lin, G., Jiang, T.: A further improved approximation algorithm for breakpoint graph decomposition. J. Comb. Optim. 8(2), 183\u2013194 (2004)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1750002","DOI":"10.1142\/S0219720017500020","volume":"15","author":"CN Lintzmayer","year":"2017","unstructured":"Lintzmayer, C.N., Fertin, G., Dias, Z.: Sorting permutations by prefix and suffix rearrangements. J. Bioinf. Comput. Biol. 15(1), 1750002 (2017)","journal-title":"J. Bioinf. Comput. Biol."},{"issue":"3","key":"7_CR15","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. Discret. Algorithms 6(3), 449\u2013457 (2008)","journal-title":"J. Discret. Algorithms"},{"key":"7_CR16","unstructured":"Vergara, J.P.C.: Sorting by bounded permutations. Ph.D. thesis, Virginia Polytechnic Institute and State University (1998)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Walter, M.E.M.T., 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 1998), pp. 96\u2013102. IEEE Computer Society, Los Alamitos (1998)","DOI":"10.1109\/SPIRE.1998.712988"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91938-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:05:29Z","timestamp":1526447129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91938-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319919379","9783319919386"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91938-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}