{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:50Z","timestamp":1725795950123},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_6","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"50-59","source":"Crossref","is-referenced-by-count":2,"title":["Reversal Distances for Strings with Few Blocks or Small Alphabets"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput.\u00a025(2), 272\u2013289 (1996)","journal-title":"SIAM J. Comput."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45749-6_21","volume-title":"Algorithms - ESA 2002","author":"P. Berman","year":"2002","unstructured":"Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-approximation algorithm for sorting by reversals. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 200\u2013210. Springer, Heidelberg (2002)"},{"key":"6_CR3","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)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proc. 1st RECOMB, pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"issue":"4","key":"6_CR5","first-page":"302","volume":"2","author":"X. Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE ACM T. Comput. Bi.\u00a02(4), 302\u2013315 (2005)","journal-title":"IEEE ACM T. Comput. Bi."},{"key":"6_CR6","unstructured":"Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow (1998)"},{"issue":"2","key":"6_CR7","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 by transpositions. SIAM J. Discrete Math.\u00a014(2), 193\u2013206 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR8","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":"6_CR9","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":"9","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1089\/cmb.2007.0048","volume":"14","author":"Z. Fu","year":"2007","unstructured":"Fu, Z., Chen, X., Vacic, V., Nan, P., Zhong, Y., Jiang, T.: MSOAR: A high-throughput ortholog assignment system based on genome rearrangement. J.\u00a0Comput.\u00a0Biol.\u00a014(9), 1160\u20131175 (2007)","journal-title":"J.\u00a0Comput.\u00a0Biol."},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/060664252","volume":"21","author":"C.A.J. 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.\u00a021(3), 592\u2013611 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s11390-010-9304-6","volume":"25","author":"T. Jiang","year":"2010","unstructured":"Jiang, T.: Some algorithmic challenges in genome-wide ortholog assignment. J. Comput. Sci. Technol.\u00a025(1), 42\u201352 (2010)","journal-title":"J. Comput. Sci. Technol."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S0895480103433550","volume":"19","author":"A. Radcliffe","year":"2006","unstructured":"Radcliffe, A., Scott, A., Wilmer, E.: Reversals and transpositions over finite alphabets. SIAM J. Discrete Math.\u00a019(1), 224 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G. Watterson","year":"1982","unstructured":"Watterson, G., Ewens, W., Hall, T., Morgan, A.: The chromosome inversion problem. J. Theor. Biol.\u00a099(1), 1\u20137 (1982)","journal-title":"J. Theor. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:00:37Z","timestamp":1558922437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}