{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:18Z","timestamp":1740099078569,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319919379"},{"type":"electronic","value":"9783319919386"}],"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_5","type":"book-chapter","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:04:12Z","timestamp":1526447052000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations"],"prefix":"10.1007","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-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":"5","key":"5_CR1","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.: Sorting by weighted reversals, transpositions, and inverted transpositions. J. Comput. Biol. 14(5), 615\u2013636 (2007)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"5_CR2","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. Discrete Math. 11(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR3","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":"1","key":"5_CR4","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.: Parametric genome rearrangement. Gene 172(1), GC11\u2013GC17 (1996)","journal-title":"Gene"},{"issue":"3","key":"5_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. 26(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR6","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. 12(1), 91\u2013110 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"5_CR7","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. 25(3), 339\u2013351 (2013)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"5_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.: 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."},{"key":"5_CR9","unstructured":"Eriksen, N.: Combinatorics of Genome Rearrangements and Phylogeny. Teknologie Licentiat Thesis, Kungliga Tekniska H\u00f6gskolan, Stockholm (2001)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR11","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 Algorithms 6(3), 449\u2013457 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"5_CR12","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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:05:04Z","timestamp":1526447104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91938-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319919379","9783319919386"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91938-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}