{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:28:01Z","timestamp":1725593281660},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_24","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T17:11:27Z","timestamp":1309194687000},"page":"273-284","source":"Crossref","is-referenced-by-count":4,"title":["Quick Greedy Computation for Minimum Common String Partitions"],"prefix":"10.1007","author":[{"given":"Isaac","family":"Goldstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TCBB.2005.48","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 Trans. Comput. Biology Bioinform.\u00a02(4), 302\u2013315 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"2","key":"24_CR2","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."},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/1103963.1103971","volume":"1","author":"M. Chrobak","year":"2005","unstructured":"Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. ACM Transactions on Algorithms\u00a01(2), 350\u2013366 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"24_CR4","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proceedings of the Annual Symposium on Discrete Algorithms (SODA), pp. 667\u2013676 (2002)"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/SFCS.1997.646102","volume-title":"FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science","author":"M. Farach","year":"1997","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 137. IEEE Computer Society, Los Alamitos (1997)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. Electr. J. Comb.\u00a012(1) (2005)","DOI":"10.1007\/978-3-540-30551-4_43"},{"issue":"1","key":"24_CR7","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. J. ACM\u00a046(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-14553-7_7","volume-title":"Frontiers in Algorithmics","author":"H. Jiang","year":"2010","unstructured":"Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 45\u201352. Springer, Heidelberg (2010)"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ipl.2005.08.010","volume":"97","author":"H. Kaplan","year":"2006","unstructured":"Kaplan, H., Shafrir, N.: The greedy algorithm for edit distance with moves. Inf. Process. Lett.\u00a097(1), 23\u201327 (2006)","journal-title":"Inf. Process. Lett."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/11549345_50","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Kolman","year":"2005","unstructured":"Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 580\u2013590. Springer, Heidelberg (2005)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Kolman, P., Walen, T.: Reversal distance for strings with duplicates: Linear time approximation using hitting set. Electr. J. Comb.\u00a014(1) (2007)","DOI":"10.1007\/11970125_22"},{"key":"24_CR12","volume-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison","author":"J. Kruskal","year":"1999","unstructured":"Kruskal, J., Sankoff, D.: Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading (1999)"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00268-X","volume":"181","author":"D.P. Lopresti","year":"1997","unstructured":"Lopresti, D.P., Tomkins, A.: Block edit models for approximate string matching. Theor. Comput. Sci.\u00a0181(1), 159\u2013179 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"issue":"2","key":"24_CR15","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.jda.2005.01.010","volume":"5","author":"D. Shapira","year":"2007","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. J. Discrete Algorithms\u00a05(2), 380\u2013392 (2007)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"24_CR16","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. Comput. Syst.\u00a02(4), 309\u2013321 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SWAT.1973.13","volume-title":"14th Annual Symposium on Switching and Automata Theory","author":"P. Weiner","year":"1973","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311. IEEE, Los Alamitos (1973)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T08:04:52Z","timestamp":1560326692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}