{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:14Z","timestamp":1725550634088},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_35","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T10:12:50Z","timestamp":1129198370000},"page":"315-326","source":"Crossref","is-referenced-by-count":2,"title":["Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty"],"prefix":"10.1007","author":[{"given":"Jin Wook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amihood","family":"Amir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jcom.1998.0493","volume":"15","author":"A. Apostolico","year":"1999","unstructured":"Apostolico, A., Landau, G.M., Skiena, S.: Matching for Run Length Encoded Strings. Journal of Complexity\u00a015(1), 4\u201316 (1999)","journal-title":"Journal of Complexity"},{"issue":"6","key":"35_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0020-0190(02)00215-6","volume":"83","author":"O. Arbell","year":"2002","unstructured":"Arbell, O., Landau, G.M., Mitchell, J.: Edit Distance of Run-Length Encoded Strings. Information Processing Letters\u00a083(6), 307\u2013314 (2002)","journal-title":"Information Processing Letters"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0020-0190(95)00005-W","volume":"54","author":"H. Bunke","year":"1995","unstructured":"Bunke, H., Csirik, H.: An Improved Algorithm for Computing the Edit Distance of Run Length Coded Strings. Information Processing Letters\u00a054, 93\u201396 (1995)","journal-title":"Information Processing Letters"},{"key":"35_CR4","unstructured":"Crochemore, M., Landau, G.M., Schieber, B., Ziv-Ukelson, M.: Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit. In: String Algorithmices. NATO Book series, KCL Press (2004)"},{"issue":"6","key":"35_CR5","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1137\/S0097539702402007","volume":"32","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. SIAM Journal on Computing\u00a032(6), 1654\u20131673 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(86)90028-1","volume":"22","author":"H. Gajewska","year":"1986","unstructured":"Gajewska, H., Tarjan, R.E.: Deques with Heap Order. Information Processing Letters\u00a022, 197\u2013200 (1986)","journal-title":"Information Processing Letters"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O.: An Improved Algorithm for Matching Biological Sequences. Journal of Molecular Biology\u00a0162, 705\u2013708 (1982)","journal-title":"Journal of Molecular Biology"},{"key":"35_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0196-8858(91)90017-D","volume":"12","author":"X. Huang","year":"1991","unstructured":"Huang, X., Miller, W.: A Time-Efficient, Linear-Space Local Similarity Algorithm. Advances in Applied Mathematics\u00a012, 337\u2013357 (1991)","journal-title":"Advances in Applied Mathematics"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-27798-9_47","volume-title":"Computing and Combinatorics","author":"J.W. Kim","year":"2004","unstructured":"Kim, J.W., Park, K.: An Efficient Local Alignment Algorithm for Masked Sequences. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 440\u2013449. Springer, Heidelberg (2004)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-48194-X_3","volume-title":"Combinatorial Pattern Matching","author":"V. M\u00e4kinen","year":"2001","unstructured":"M\u00e4kinen, V., Navarro, G., Ukkonen, E.: Approximate Matching of Run-Length Compressed Strings. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 31\u201349. Springer, Heidelberg (2001)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00453-002-1005-2","volume":"35","author":"V. M\u00e4kinen","year":"2003","unstructured":"M\u00e4kinen, V., Navarro, G., Ukkonen, E.: Approximate Matching of Run-Length Compressed Strings. Algorithmica\u00a035, 347\u2013369 (2003)","journal-title":"Algorithmica"},{"key":"35_CR13","unstructured":"Mitchell, J.: A Geometric Shortest Path Problem, with Application to Computing a Longest Common Subsequence in Run-Length Encoded Strings. Technical Report, Dept. of Applied Mathematics, SUNY Stony Brook (1997)"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. Journal of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:42:57Z","timestamp":1619491377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11575832_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}