{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:29Z","timestamp":1746331409672,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"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_13","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:58:08Z","timestamp":1402419488000},"page":"158-170","source":"Crossref","is-referenced-by-count":1,"title":["On the Diameter of Rearrangement Problems"],"prefix":"10.1007","author":[{"given":"Carla Negri","family":"Lintzmayer","sequence":"first","affiliation":[]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bafna, V., Pevzner, P.A.: Genome Rearrangements and Sorting by Reversals. In: Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), pp. 148\u2013157 (1993)","DOI":"10.1109\/SFCS.1993.366872"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-32589-2_24","volume-title":"Mathematical Foundations of Computer Science 2012","author":"L. Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Pancake Flipping is Hard. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 247\u2013258. Springer, Heidelberg (2012)"},{"issue":"3","key":"13_CR3","first-page":"1148","volume":"26","author":"L. Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by Transpositions is Difficult. SIAM Journal on Computing\u00a026(3), 1148\u20131180 (2012)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"13_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 Journal on Discrete Mathematics\u00a012(1), 91\u2013110 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"36","key":"13_CR5","doi-asserted-by":"publisher","first-page":"3372","DOI":"10.1016\/j.tcs.2008.04.045","volume":"410","author":"B. Chitturi","year":"2009","unstructured":"Chitturi, B., Fahle, W., Meng, Z., Morales, L., Shields, C.O., Sudborough, I.H., Voit, W.: An (18\/11)n Upper Bound for Sorting by Prefix Reversals. Theoretical Computer Science\u00a0410(36), 3372\u20133390 (2009)","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2011.11.018","volume":"421","author":"B. Chitturi","year":"2012","unstructured":"Chitturi, B., Sudborough, I.H.: Bounding Prefix Transposition Distance for Strings and Permutations. Theoretical Computer Science\u00a0421, 15\u201324 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"8-10","key":"13_CR7","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"},{"key":"13_CR8","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.\u00a02476, pp. 65\u201376. Springer, Heidelberg (2002)"},{"issue":"4","key":"13_CR9","first-page":"369","volume":"3","author":"I. Elias","year":"2006","unstructured":"Elias, I., Hartman, T.: A 1.375-Approximation Algorithm for Sorting by Transpositions. 375-Approximation Algorithm for Sorting by Transpositions\u00a03(4), 369\u2013379 (2006)","journal-title":"375-Approximation Algorithm for Sorting by Transpositions"},{"issue":"1-3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","volume":"241","author":"H. Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., Wastlund, J.: Sorting a Bridge Hand. Discrete Mathematics\u00a0241(1-3), 289\u2013300 (2001)","journal-title":"Discrete Mathematics"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, \u00c9., Vialette, S.: Combinatorics of Genome Rearrangements. In: Computational Molecular Biology. MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Galv\u00e3o, G.R., Dias, Z.: Computing Rearrangement Distance of Every Permutation in the Symmetric Group. In: Chu, W.C., Wong, W.E., Palakal, M.J., Hung, C.C. (eds.) Proceedings of the 26th ACM Symposium on Applied Computing (SAC 22011), pp. 106\u2013107. ACM (2011)","DOI":"10.1145\/1982185.1982212"},{"issue":"1","key":"13_CR13","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":"1","key":"13_CR14","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":"1","key":"13_CR15","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"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-87744-8_53","volume-title":"Algorithms - ESA 2008","author":"A. Labarre","year":"2008","unstructured":"Labarre, A.: Edit Distances and Factorisations of Even Permutations. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 635\u2013646. Springer, Heidelberg (2008)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Lintzmayer, C.N., Dias, Z.: On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions. In: Dediu, A.H., Mart\u00edn-Vide, C., Truthe, B. (eds.) Proceedings of the 1st International Conference on Algorithms for Computational Biology (AlCoB 2014), Tarragona, Spain, pp. 1\u201312. Springer (2014)","DOI":"10.1007\/978-3-319-07953-0_12"},{"key":"13_CR18","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)"},{"issue":"5","key":"13_CR19","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1089\/106652702761034163","volume":"9","author":"J. Meidanis","year":"2002","unstructured":"Meidanis, J., Walter, M.M.T., Dias, Z.: A Lower Bound on the Reversal and Transposition Diameter. Journal of Computational Biology\u00a09(5), 743\u2013745 (2002)","journal-title":"Journal of Computational Biology"},{"key":"13_CR20","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"},{"key":"13_CR21","first-page":"96","volume-title":"Proceedings of the 5th International Symposium on String Processing and Information Retrieval (SPIRE 1998)","author":"M.E.M.T. Walter","year":"1998","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, Santa Cruz (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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:06:23Z","timestamp":1746263183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07953-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079523","9783319079530"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07953-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}