{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:20Z","timestamp":1759637720830,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319023083"},{"type":"electronic","value":"9783319023090"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-02309-0_18","type":"book-chapter","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T07:57:47Z","timestamp":1379577467000},"page":"173-181","source":"Crossref","is-referenced-by-count":1,"title":["Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Agnieszka","family":"Danek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Deorowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(86)90091-8","volume":"23","author":"L. Allison","year":"1986","unstructured":"Allison, L., Dix, T.I.: A bit-string longest-common-subsequence algorithm. Information Processing Letters\u00a023(6), 305\u2013310 (1986)","journal-title":"Information Processing Letters"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Apostolico, A.: General pattern matching. In: Atallah, M.J., Blanton, M. (eds.) Algorithms and Theory of Computation Handbook, ch. 13, pp. 1\u201322. CRC Press (1998)","DOI":"10.1201\/9781584888239-c15"},{"issue":"10","key":"18_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"key":"18_CR4","first-page":"71","volume":"11","author":"T. Crawford","year":"1998","unstructured":"Crawford, T., Iliopoulos, C.S., Raman, R.: String matching techniques for musical similarity and melodic recognition. Computing in Musicology\u00a011, 71\u2013100 (1998)","journal-title":"Computing in Musicology"},{"issue":"6","key":"18_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0020-0190(01)00182-X","volume":"80","author":"M. Crochemore","year":"2001","unstructured":"Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters\u00a080(6), 279\u2013285 (2001)","journal-title":"Information Processing Letters"},{"issue":"4","key":"18_CR6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.3233\/FI-2010-256","volume":"99","author":"S. Deorowicz","year":"2010","unstructured":"Deorowicz, S.: Bit-parallel algorithm for the constrained longest common subsequence problem. Fundamenta Informaticae\u00a099(4), 409\u2013433 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR7","unstructured":"Deorowicz, S., Danek, A.: Bit-parallel algorithm for the merged longest common subsequence problem. International Journal of Foundations of Computer Science (to appear)"},{"key":"18_CR8","first-page":"29","volume":"3","author":"B. D\u00f6m\u00f6lki","year":"1964","unstructured":"D\u00f6m\u00f6lki, B.: An algorithm for syntactical analysis. Computational Linguistics\u00a03, 29\u201346 (1964)","journal-title":"Computational Linguistics"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences\u2014Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"5","key":"18_CR10","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2007.08.028","volume":"105","author":"K.S. Huang","year":"2008","unstructured":"Huang, K.S., Yang, C.B., Tseng, K.T., Ann, H.Y., Peng, Y.H.: Efficient algorithms for finding interleaving relationship between sequences. Information Processing Letters\u00a0105(5), 188\u2013193 (2008)","journal-title":"Information Processing Letters"},{"issue":"2-3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ipl.2006.11.006","volume":"102","author":"K.S. Huang","year":"2007","unstructured":"Huang, K.S., Yang, C.B., Tseng, K.T., Peng, Y.H., Ann, H.Y.: Dynamic programming algorithms for the mosaic longest common subsequence problem. Information Processing Letters\u00a0102(2-3), 99\u2013103 (2007)","journal-title":"Information Processing Letters"},{"key":"18_CR12","unstructured":"Hyyr\u00f6, H.: Bit-parallel LCS-length computation revisited. In: Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004), pp. 16\u201327 (2004)"},{"issue":"6983","key":"18_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1038\/nature02424","volume":"428","author":"M. Kellis","year":"2004","unstructured":"Kellis, M., Birren, B.W., Lander, E.S.: Proof and evolutionary analysis of ancient genome duplication in the yeast saccharomyces cerevisiae. Nature\u00a0428(6983), 617\u2013624 (2004)","journal-title":"Nature"},{"issue":"4","key":"18_CR14","first-page":"1935","volume":"6","author":"Y.H. Peng","year":"2010","unstructured":"Peng, Y.H., Yang, C.B., Huang, K.S., Tseng, C.T., Hor, C.Y.: Efficient sparse dynamic programming for the merged lcs problem with block constraints. International Journal of Innovative Computing, Information and Control\u00a06(4), 1935\u20131947 (2010)","journal-title":"International Journal of Innovative Computing, Information and Control"},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","volume":"88","author":"Y.T. Tsai","year":"2003","unstructured":"Tsai, Y.T.: The constrained longest common subsequence problem. Information Processing Letters\u00a088(4), 173\u2013176 (2003)","journal-title":"Information Processing Letters"},{"issue":"5","key":"18_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ipl.2004.10.014","volume":"93","author":"I.H. Yang","year":"2005","unstructured":"Yang, I.H., Chien-Pin, H., Chao, K.M.: A fast algorithm for computing a longest common increasing subsequence. Information Processing Letters\u00a093(5), 249\u2013253 (2005)","journal-title":"Information Processing Letters"}],"container-title":["Advances in Intelligent Systems and Computing","Man-Machine Interactions 3"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02309-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T16:08:57Z","timestamp":1676822937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-02309-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319023083","9783319023090"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02309-0_18","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}