{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:29Z","timestamp":1740099089558,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"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_6","type":"book-chapter","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:04:12Z","timestamp":1526447052000},"page":"65-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics for the Sorting Signed Permutations by Reversals and Transpositions Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5287-2925","authenticated-orcid":false,"given":"Klairton Lima","family":"Brito","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre Rodrigues","family":"Oliveira","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":[[2018,5,17]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"DA Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8, 483\u2013491 (2001)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"6_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."},{"issue":"3","key":"6_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":"6_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. Discrete Math. 12(1), 91\u2013110 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"6_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."},{"key":"6_CR6","unstructured":"Christie, D.A.: Genome rearrangement problems. Ph.D. thesis, Department of Computing Science, University of Glasgow (1998)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Dias, U., Dias, Z.: Extending Bafna-Pevzner algorithm. In: Proceedings of the 1st International Symposium on Biocomputing (ISB 2010), pp. 1\u20138. ACM, New York (2010)","DOI":"10.1145\/1722024.1722051"},{"issue":"3","key":"6_CR8","first-page":"26","volume":"12","author":"U Dias","year":"2014","unstructured":"Dias, U., Galv\u00e3o, G.R., Lintzmayer, C.N., Dias, Z.: A general heuristic for genome rearrangement problems. J. Bioinform. Comput. Biol. 12(3), 26 (2014)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"6_CR9","first-page":"1","volume":"19","author":"GR Galv\u00e3o","year":"2014","unstructured":"Galv\u00e3o, G.R., Dias, Z.: An audit tool for genome rearrangement algorithms. J. Exp. Algorithmics 19, 1\u201334 (2014)","journal-title":"J. Exp. Algorithmics"},{"issue":"1","key":"6_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":"6_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"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65(3), 587\u2013609 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1093\/bioinformatics\/18.3.492","volume":"18","author":"G Tesler","year":"2002","unstructured":"Tesler, G.: GRIMM: genome rearrangements web server. Bioinformatics 18(3), 492\u2013493 (2002)","journal-title":"Bioinformatics"},{"key":"6_CR14","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), Santa Cruz de La Sierra, Bolivia, pp. 96\u2013102. IEEE Computer Society (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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:05:17Z","timestamp":1526447117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91938-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319919379","9783319919386"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91938-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}