{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:45:25Z","timestamp":1794339925373,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_36","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"352-363","source":"Crossref","is-referenced-by-count":4,"title":["All Semi-local Longest Common Subsequences in Subquadratic Time"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Tiskin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.endm.2005.05.019","volume":"19","author":"C.E.R. Alves","year":"2005","unstructured":"Alves, C.E.R., C\u00e1ceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics\u00a019, 133\u2013139 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"36_CR2","first-page":"1209","volume":"11","author":"V.L. Arlazarov","year":"1970","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economical construction of the transitive closure of an oriented graph. Soviet Mathematical Doklady\u00a011, 1209\u20131210 (1970)","journal-title":"Soviet Mathematical Doklady"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"R.E. Burkard","year":"1996","unstructured":"Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discrete Applied Mathematics\u00a070, 95\u2013161 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"36_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 score matrices. SIAM Journal on Computing\u00a032(6), 1654\u20131673 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR6","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"36_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-30551-4_49","volume-title":"Algorithms and Computation","author":"J. JaJa","year":"2004","unstructured":"JaJa, J., Mortensen, C., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 558\u2013568. Springer, Heidelberg (2004)"},{"key":"36_CR9","volume-title":"Computational Molecular Biology","author":"N.C. Jones","year":"2004","unstructured":"Jones, N.C., Pevzner, P.A.: An introduction to bioinformatics algorithms. In: Computational Molecular Biology. The MIT Press, Cambridge (2004)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S1570-8667(03)00082-0","volume":"2","author":"S.-R. Kim","year":"2004","unstructured":"Kim, S.-R., Park, K.: A dynamic edit distance table. Journal of Discrete Algorithms\u00a02, 303\u2013312 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-27801-6_13","volume-title":"Combinatorial Pattern Matching","author":"G.M. Landau","year":"2004","unstructured":"Landau, G.M., Myers, E., Ziv-Ukelson, M.: Two algorithms for LCS consecutive suffix alignment. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 173\u2013193. Springer, Heidelberg (2004)"},{"issue":"2","key":"36_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"G.M. Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM Journal on Computing\u00a027(2), 557\u2013582 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1006\/jagm.2001.1191","volume":"41","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Ziv-Ukelson, M.: On the common substring alignment problem. Journal of Algorithms\u00a041, 338\u2013359 (2001)","journal-title":"Journal of Algorithms"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. Journal of Computer and System Sciences\u00a020, 18\u201331 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"36_CR16","volume-title":"Texts and Monographs in Computer Science","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. In: Texts and Monographs in Computer Science, Springer, Heidelberg (1985)"},{"issue":"4","key":"36_CR17","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"J.P. Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing\u00a027(4), 972\u2013992 (1998)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:40Z","timestamp":1619492620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11753728_36","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}