{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:58:20Z","timestamp":1725512300476},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540720300"},{"type":"electronic","value":"9783540720317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72031-7_40","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T10:16:24Z","timestamp":1186308984000},"page":"441-452","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Greedy Algorithm for the Minimum Common String Partition Problem"],"prefix":"10.1007","author":[{"given":"Dan","family":"He","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Chen, X., et al.: Computing the assignment of orthologous genes via genome rearrangement. In: Proc. of Asia Pacific Bioinformatics Conference, Jan. 18-20, 2005, pp. 363\u2013378 (2005)","DOI":"10.1142\/9781860947322_0037"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/978-3-540-30551-4_43","volume-title":"Algorithms and Computation","author":"A. Goldstein","year":"2004","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: hardness and approximation. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 484\u2013495. Springer, Heidelberg (2004)"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: A greedy algorithm for the minimum common string partition problem. In: Jansen, K., et al. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 84\u201395. Springer, Heidelberg (2004)"},{"key":"40_CR4","unstructured":"Cormode, G., Muthukrishnan, J.A.: The string edit distance matching with moves. In: Proc. 13th Annual Symposium on Discrete Algorithms (SODA), pp. 667\u2013676 (2002)"},{"key":"40_CR5","volume-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","author":"J.B. Kruskal","year":"1983","unstructured":"Kruskal, J.B., Snakoff, D.: An anthology of algorithms and concepts for sequence comparision. In: Sankoff, D., Kruskal, J.B. (eds.) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading (1983)"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00268-X","volume":"181","author":"D. Lopresti","year":"1997","unstructured":"Lopresti, D., Tomkins, A.: Block edit models for approximate string matching. Theoretical Computer Science\u00a0181, 159\u2013179 (1997)","journal-title":"Theoretical Computer Science"},{"key":"40_CR7","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, pp. 85\u201398. Springer, Heidelberg (2002)"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/357401.357404","volume":"2","author":"W.F. Tichy","year":"1984","unstructured":"Tichy, W.F.: The string-to-string correction problem with block moves. ACM Trans. Computer Systems\u00a02, 309\u2013321 (1984)","journal-title":"ACM Trans. Computer Systems"},{"key":"40_CR9","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., et al.: The chromosome inversion problem. J. of Theoretical Biology\u00a099, 1\u20137 (1982)","journal-title":"J. of Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72031-7_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:28:09Z","timestamp":1605745689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72031-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540720300","9783540720317"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72031-7_40","relation":{},"subject":[]}}