{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:51:06Z","timestamp":1743047466611,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030017217"},{"type":"electronic","value":"9783030017224"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-030-01722-4_1","type":"book-chapter","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T05:05:22Z","timestamp":1538370322000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sorting $$\\lambda $$-Permutations by $$\\lambda $$-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-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro Oliveira","family":"Alexandrino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0602-6298","authenticated-orcid":false,"given":"Carla","family":"Negri 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,10,2]]},"reference":[{"key":"1_CR1","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":"1_CR2","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":"1_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. Discret. Math. 12(1), 91\u2013110 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M., P\u0103tra\u015fcu, M.: Counting inversions, offline orthogonal range counting, and related problems. In: Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 161\u2013173. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.15"},{"issue":"3","key":"1_CR5","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":"1_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. 3(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"5","key":"1_CR7","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."},{"key":"1_CR8","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":"1_CR9","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"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-91938-6_7","volume-title":"Algorithms for Computational Biology","author":"GHS Miranda","year":"2018","unstructured":"Miranda, G.H.S., Lintzmayer, C.N., Dias, Z.: Sorting permutations by limited-size operations. In: Jansson, J., Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2018. LNCS, vol. 10849, pp. 76\u201387. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91938-6_7"},{"issue":"3","key":"1_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. Discret. Algorithms 6(3), 449\u2013457 (2008)","journal-title":"J. Discret. Algorithms"},{"key":"1_CR12","unstructured":"Vergara, J.P.C.: Sorting by Bounded Permutations. Ph.D. thesis, Virginia Polytechnic Institute and State University (1998)"},{"key":"1_CR13","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 (1998)","DOI":"10.1109\/SPIRE.1998.712988"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01722-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T16:17:00Z","timestamp":1540397820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01722-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030017217","9783030017224"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01722-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"BSB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Bioinformatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Niter\u00f3i","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wob2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bsb2018.ic.uff.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}