{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T07:31:16Z","timestamp":1778916676562,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540241317","type":"print"},{"value":"9783540305514","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_43","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"484-495","source":"Crossref","is-referenced-by-count":42,"title":["Minimum Common String Partition Problem: Hardness and Approximations"],"prefix":"10.1007","author":[{"given":"Avraham","family":"Goldstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kolman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-36136-7_41","volume-title":"Algorithms and Computation","author":"A. Avidor","year":"2002","unstructured":"Avidor, A., Zwick, U.: Approximating MIN k-SAT. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 465\u2013475. Springer, Heidelberg (2002)"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results. In: Proc. of the of 26th International Colloquium on Automata, Languages and Programming (ICALP), pp. 200\u2013209 (1999)","DOI":"10.1007\/3-540-48523-6_17"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proc. of the First International Conference on Computational Molecular Biology, pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"key":"43_CR4","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. Submitted (2004)","DOI":"10.1142\/9781860947322_0037"},{"issue":"2","key":"43_CR5","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 Journal on Discrete Mathematics\u00a014(2), 193\u2013206 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-27821-4_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 84\u201395. Springer, Heidelberg (2004)"},{"key":"43_CR7","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proc. of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA), pp. 667\u2013676 (2002)"},{"key":"43_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1978)"},{"issue":"1","key":"43_CR9","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"},{"key":"43_CR10","volume-title":"Current Topics in Computational Molecular Biology","author":"D. Sankoff","year":"2002","unstructured":"Sankoff, D., El-Mabrouk, N.: Genome rearrangement. In: Jiang, T., Xu, Y., Zhang, M.Q. (eds.) Current Topics in Computational Molecular Biology, MIT Press, Cambridge (2002)"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45452-7_9","volume-title":"Combinatorial Pattern Matching","author":"D. Shapira","year":"2002","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, p. 85. Springer, Heidelberg (2002)"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G.A. Watterson","year":"1982","unstructured":"Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. Journal of Theoretical Biology\u00a099, 1\u20137 (1982)","journal-title":"Journal of Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:27Z","timestamp":1605759687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}