{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:53Z","timestamp":1725488993202},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734321"},{"type":"electronic","value":"9783540734338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73433-8_21","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:36:40Z","timestamp":1186843000000},"page":"292-306","source":"Crossref","is-referenced-by-count":1,"title":["Prefix Reversals on Binary and Ternary Strings"],"prefix":"10.1007","author":[{"given":"Cor","family":"Hurkens","sequence":"first","affiliation":[]},{"given":"Leo","family":"van Iersel","sequence":"additional","affiliation":[]},{"given":"Judith","family":"Keijsper","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[]},{"given":"John","family":"Tromp","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/11732990_46","volume-title":"Research in Computational Molecular Biology","author":"M. Bader","year":"2006","unstructured":"Bader, M., Ohlebusch, E.: Sorting by weighted reversals, transpositions, and inverted transpositions. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P., Waterman, M. (eds.) RECOMB 2006. LNCS (LNBI), vol.\u00a03909, pp. 563\u2013577. Springer, Heidelberg (2006)"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1089\/cmb.2006.13.567","volume":"13","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. J. Comp. Biol.\u00a013(2), 567\u2013578 (2006)","journal-title":"J. Comp. Biol."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement, IEEE\/ACM Trans. Comput. Biol. Bioinform. 2(4) (October- December 2005)","DOI":"10.1109\/TCBB.2005.48"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/S0895480197331995","volume":"14","author":"D.A. Christie","year":"2001","unstructured":"Christie, D.A., Irving, R.W.: Sorting strings by reversals and transpositions. SIAM J. on Discrete Math.\u00a014(2), 193\u2013206 (2001)","journal-title":"SIAM J. on Discrete Math."},{"issue":"2","key":"21_CR5","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 Appl. Math.\u00a061(2), 105\u2013120 (1995)","journal-title":"Discrete Appl. Math"},{"issue":"4","key":"21_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. Biology Bioinform.\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"21_CR7","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 Math.\u00a0241, 289\u2013300 (2001)","journal-title":"Discrete Math"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/11561071_38","volume-title":"Algorithms \u2013 ESA 2005","author":"J. Fischer","year":"2005","unstructured":"Fischer, J., Ginzinger, S.W.: A 2-approximation algorithm for sorting by prefix reversals. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 415\u2013425. Springer, Heidelberg (2005)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput.\u00a04(4), 397\u2013411 (1975)","journal-title":"SIAM J. Comput."},{"key":"21_CR10","volume-title":"Computers And Intractability: A Guide To The Theory Of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers And Intractability: A Guide To The Theory Of NP-completeness. W.H. Freeman, San Francisco, CA (1979)"},{"key":"21_CR11","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 Math.\u00a027, 47\u201357 (1979)","journal-title":"Discrete Math"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum Common String Partition problem: hardness and approximations, Electron. J. Combin. 12, #R50 (2005)","DOI":"10.37236\/1947"},{"issue":"1","key":"21_CR13","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: a polynomial algorithm for sorting permutations by reversals. Jour. ACM\u00a046(1), 1\u201327 (1999)","journal-title":"Jour. ACM"},{"key":"21_CR14","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. J. Algorithms\u00a025, 67\u201394 (1997)","journal-title":"J. Algorithms"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Hurkens, C.A.J., van Iersel, L.J.J., Keijsper, J.C.M., Kelk, S.M., Stougie, L., Tromp, J.T.: Prefix reversals on binary and ternary strings, technical report (2006), http:\/\/www.win.tue.nl\/bs\/spor\/2006-10.pdf","DOI":"10.1007\/978-3-540-73433-8_21"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Morales, L., Sudborough, I.H.: Comparing Star and Pancake Networks. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 18\u201336. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36377-7_2"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S0895480103433550","volume":"19","author":"A.J. Radcliffe","year":"2005","unstructured":"Radcliffe, A.J., Scott, A.D., Wilmer, E.L.: Reversals and transpositions over finite alphabets. SIAM J. on Discrete Math.\u00a019(1), 224\u2013244 (2005)","journal-title":"SIAM J. on Discrete Math."},{"key":"21_CR18","unstructured":"Scott, A.D.: Personal communication"}],"container-title":["Lecture Notes in Computer Science","Algebraic Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73433-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T20:11:35Z","timestamp":1587845495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73433-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734321","9783540734338"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73433-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}