{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:40:10Z","timestamp":1725795610723},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079523"},{"type":"electronic","value":"9783319079530"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07953-0_12","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:58:08Z","timestamp":1402419488000},"page":"146-157","source":"Crossref","is-referenced-by-count":1,"title":["On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions"],"prefix":"10.1007","author":[{"given":"Carla Negri","family":"Lintzmayer","sequence":"first","affiliation":[]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8-10","key":"12_CR1","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1016\/j.tcs.2010.11.028","volume":"412","author":"J. Cibulka","year":"2011","unstructured":"Cibulka, J.: On Average and Highest Number of Flips in Pancake Sorting. Theoretical Computer Science\u00a0412(8-10), 822\u2013834 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(94)00009-3","volume":"61","author":"D.S. Cohen","year":"1995","unstructured":"Cohen, D.S., Blum, M.: On the Problem of Sorting Burnt Pancakes. Discrete Applied Mathematics\u00a061(2), 105\u2013120 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, \u00c9., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"12_CR4","unstructured":"Galv\u00e3o, G.R.: Uma Ferramenta de Auditoria para Algoritmos de Rearranjo de Genomas. Master\u2019s thesis, University of Campinas, Institute of Computing, Campinas, S\u00e3o Paulo, Brazil (2012) (in Portuguese)"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W.H. Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, C.H.: Bounds for Sorting by Prefix Reversal. Discrete Mathematics\u00a027(1), 47\u201357 (1979)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0304-3975(98)00092-9","volume":"210","author":"Q.P. Gu","year":"1999","unstructured":"Gu, Q.P., Peng, S., Sudborough, I.H.: A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theoretical Computer Science\u00a0210(2), 327\u2013339 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR7","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. Journal of the ACM\u00a046(1), 1\u201327 (1999)","journal-title":"Journal of the ACM"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.jcss.2004.12.006","volume":"70","author":"T. Hartman","year":"2005","unstructured":"Hartman, T., Sharan, R.: A 1. 5-Approximation Algorithm for Sorting by Transpositions and Transreversals. Journal of Computer and System Sciences\u00a070(3), 300\u2013320 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1997.0874","volume":"25","author":"M.H. Heydari","year":"1997","unstructured":"Heydari, M.H., Sudborough, I.H.: On the Diameter of the Pancake Network. Journal of Algorithms\u00a025(1), 67\u201394 (1997)","journal-title":"Journal of Algorithms"},{"issue":"1-2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0304-3975(00)00038-4","volume":"259","author":"G.H. Lin","year":"2001","unstructured":"Lin, G.H., Xue, G.: Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations. Theoretical Computer Science\u00a0259(1-2), 513\u2013531 (2001)","journal-title":"Theoretical Computer Science"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-54423-1_58","volume-title":"LATIN 2014: Theoretical Informatics","author":"C.N. Lintzmayer","year":"2014","unstructured":"Lintzmayer, C.N., Dias, Z.: Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol.\u00a08392, pp. 671\u2013682. Springer, Heidelberg (2014)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Sharmin, M., Yeasmin, R., Hasan, M., Rahman, A., Rahman, M.S.: Pancake Flipping with Two Spatulas. In: International Symposium on Combinatorial Optimization (ISCO 2010). Electronic Notes in Discrete Mathematics, vol.\u00a036, pp. 231\u2013238 (2010)","DOI":"10.1016\/j.endm.2010.05.030"},{"issue":"6-7","key":"12_CR13","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E. Tannier","year":"2007","unstructured":"Tannier, E., Bergeron, A., Sagot, M.F.: Advances on Sorting by Reversals. Discrete Applied Mathematics\u00a0155(6-7), 881\u2013888 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR14","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, Bolivia, pp. 96\u2013102. IEEE Computer Society (1998)"}],"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-07953-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T01:24:04Z","timestamp":1558920244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07953-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079523","9783319079530"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07953-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}