{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:19:09Z","timestamp":1742962749661,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238258"},{"type":"electronic","value":"9783319238265"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23826-5_17","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"165-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Prefix and Suffix Reversals on Strings"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[]},{"given":"Lo\u00efc","family":"Jankowiak","sequence":"additional","affiliation":[]},{"given":"G\u00e9raldine","family":"Jean","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"key":"17_CR1","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. 7464, pp. 247\u2013258. Springer, Heidelberg (2012)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-319-07566-2_6","volume-title":"Combinatorial Pattern Matching","author":"L Bulteau","year":"2014","unstructured":"Bulteau, L., Fertin, G., Komusiewicz, C.: Reversal distances for strings with few blocks or small alphabets. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 50\u201359. Springer, Heidelberg (2014)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proceedings of the First Annual International Conference on Computational Molecular Biology. RECOMB 1997, pp. 75\u201383. ACM, New York (1997)","DOI":"10.1145\/267521.267531"},{"key":"17_CR4","unstructured":"Christie, D.: Genome Rearrangement Problems. Ph.D. thesis, University of Glasgow (1998)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/S0895480197331995","volume":"14","author":"DA Christie","year":"2001","unstructured":"Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM J. Discret. Math. 14(2), 193\u2013206 (2001)","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. Computational Molecular Biology. MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"17_CR7","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"1","key":"17_CR8","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":"17_CR9","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/060664252","volume":"21","author":"CAJ Hurkens","year":"2007","unstructured":"Hurkens, C.A.J., van Iersel, L., Keijsper, J., Kelk, S., Stougie, L., Tromp, J.: Prefix reversals on binary and ternary strings. SIAM J. Discrete Math. 21(3), 592\u2013611 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR10","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":"CN 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. 8392, pp. 671\u2013682. Springer, Heidelberg (2014)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-319-07953-0_13","volume-title":"Algorithms for Computational Biology","author":"CN Lintzmayer","year":"2014","unstructured":"Lintzmayer, C.N., Dias, Z.: On the diameter of rearrangement problems. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) AlCoB 2014. LNCS, vol. 8542, pp. 158\u2013170. Springer, Heidelberg (2014)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Radcliffe, A.J., Scott, A.D., Wilmer, E.L.: Reversals and transpositions over finite alphabets. SIAM J. Discret. Math. (2005)","DOI":"10.1137\/S0895480103433550"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.jda.2015.03.009","volume":"33","author":"MK Rahman","year":"2015","unstructured":"Rahman, M.K., Rahman, M.S.: Prefix and suffix transreversals on binary and ternary strings. Journal of Discrete Algorithms 33, 160\u2013170 (2015)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23826-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T15:44:35Z","timestamp":1676475875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}