{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:29:39Z","timestamp":1725560979336},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_27","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"314-325","source":"Crossref","is-referenced-by-count":6,"title":["Merging and Sorting By Strip Moves"],"prefix":"10.1007","author":[{"given":"Meena","family":"Mahajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghavan","family":"Rama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Vijayakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. SIAM Journal on Computing\u00a025, 272\u2013289 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.: Sorting by transpositions. SIAM Journal on Discrete Mathematics\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1093\/bioinformatics\/11.1.49","volume":"11","author":"H. Boedlander","year":"1995","unstructured":"Boedlander, H., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Bioinformatics\u00a011, 49\u201357 (1995)","journal-title":"Bioinformatics"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting permutations by block-interchanges. Information Processing Letters\u00a060, 165\u2013169 (1996)","journal-title":"Information Processing Letters"},{"key":"27_CR5","unstructured":"Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow (1999)"},{"issue":"2","key":"27_CR6","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.: Sorting strings by reversals and by transpositions. SIAM Journal on Discrete Mathematics\u00a014(2), 193\u2013206 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR7","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1997","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1997)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/S0304-3975(01)00338-3","volume":"289","author":"N. Eriksen","year":"2002","unstructured":"Eriksen, N.: 1 + \u03b5 approximation for sorting by reversals and transpositions. Theoretical Computer Science\u00a0289, 517\u2013529 (2002)","journal-title":"Theoretical Computer Science"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","volume":"241","author":"H. Erikson","year":"2001","unstructured":"Erikson, H., Eriksson, K., Karlander, J., Svensson, L., W\u00e4stlund, J.: Sorting a bridge hand. Discrete Mathematics\u00a0241, 289\u2013300 (2001)","journal-title":"Discrete Mathematics"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Hallett, M.T., Wareham, H.T.: DNA physical mapping: 3 ways difficult. In: Proceedings of the European Symposium on Algorithms ESA, pp. 157\u2013168 (1993)","DOI":"10.1007\/3-540-57273-2_52"},{"issue":"2","key":"27_CR11","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, 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"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-44888-8_12","volume-title":"Combinatorial Pattern Matching","author":"T. Hartman","year":"2003","unstructured":"Hartman, T.: A simpler 1.5 approximation algorithm for sorting by transpositions. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 156\u2013169. Springer, Heidelberg (2003)"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s004530010041","volume":"28","author":"L.S. Heath","year":"2000","unstructured":"Heath, L.S., Vergara, J.P.C.: Sorting by short block moves. Algorithmica\u00a028, 323\u2013352 (2000)","journal-title":"Algorithmica"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J. Kececioglu","year":"1995","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica\u00a013, 180\u2013210 (1995)","journal-title":"Algorithmica"},{"key":"27_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology: An Algorithmic Approach","author":"P. Pevzner","year":"2000","unstructured":"Pevzner, P.: Computational Molecular Biology: An Algorithmic Approach. MIT Press, Cambridge (2000)"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:46:18Z","timestamp":1558298778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}