{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T15:46:33Z","timestamp":1746891993121,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819759361"},{"type":"electronic","value":"9789819759378"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-5937-8_17","type":"book-chapter","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T08:02:36Z","timestamp":1723449756000},"page":"202-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Merged Longest Common Increasing Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Chien-Ting","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-Biau","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Si","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,13]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Kaligosi, K., Katriel, I., Kutz, M.: Faster algorithms for computing longest common increasing subsequences. In: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM), Barcelona, Spain, pp. 330\u2013341 (2006)","DOI":"10.1007\/11780441_30"},{"issue":"3","key":"17_CR2","first-page":"472","volume":"45","author":"D Cai","year":"2018","unstructured":"Cai, D., Zhu, D., Wang, L., Wang, X.: A simple linear space algorithm for computing a longest common increasing subsequence. IAENG Int. J. Comput. Sci. 45(3), 472\u2013477 (2018)","journal-title":"IAENG Int. J. Comput. Sci."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10878-006-9031-7","volume":"13","author":"WT Chan","year":"2007","unstructured":"Chan, W.T., Zhang, Y., Fung, S.P.Y., Ye, D., Zhu, H.: Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim. 13(3), 277\u2013288 (2007)","journal-title":"J. Comb. Optim."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1142\/S0129054113500342","volume":"24","author":"S Deorowicz","year":"2013","unstructured":"Deorowicz, S., Danek, A.: Bit-parallel algorithms for the merged longest common subsequence problem. Int. J. Found. Comput. Sci. 24, 1281\u20131298 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"17_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2007.08.028","volume":"105","author":"KS 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. Inf. Process. Lett. 105, 188\u2013193 (2008)","journal-title":"Inf. Process. Lett."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"JW Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Commun. ACM 20, 350\u2013353 (1977)","journal-title":"Commun. ACM"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2020.02.024","volume":"815","author":"SF Lo","year":"2020","unstructured":"Lo, S.F., Tseng, K.T., Yang, C.B., Huang, K.S.: A diagonal-based algorithm for the longest common increasing subsequence problem. Theoret. Comput. Sci. 815, 69\u201378 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM (JACM) 25(2), 322\u2013336 (1978)","journal-title":"J. ACM (JACM)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00264437","volume":"18","author":"N Nakatsu","year":"1982","unstructured":"Nakatsu, N., Kambayashi, Y., Yajima, S.: A longest common subsequence algorithm suitable for similar text strings. Acta Informatica 18, 171\u2013179 (1982)","journal-title":"Acta Informatica"},{"key":"17_CR11","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 6, 1935\u20131947 (2010)"},{"issue":"8","key":"17_CR12","first-page":"1743","volume":"9","author":"AM Rahman","year":"2014","unstructured":"Rahman, A.M., Rahman, M.S.: Effective sparse dynamic programming algorithms for merged and block merged LCS problems. J. Comput. 9(8), 1743\u20131754 (2014)","journal-title":"J. Comput."},{"issue":"5","key":"17_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ipl.2006.05.005","volume":"99","author":"Y Sakai","year":"2006","unstructured":"Sakai, Y.: A linear space algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 99(5), 203\u2013207 (2006)","journal-title":"Inf. Process. Lett."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2017.10.027","volume":"708","author":"KT Tseng","year":"2018","unstructured":"Tseng, K.T., Chan, D.S., Yang, C.B., Lo, S.F.: Efficient merged longest common subsequence algorithms for similar sequences. Theoret. Comput. Sci. 708, 75\u201390 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R Wagner","year":"1974","unstructured":"Wagner, R., Fischer, M.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"5","key":"17_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ipl.2004.10.014","volume":"93","author":"IH Yang","year":"2005","unstructured":"Yang, I.H., Huang, C.P., Chao, K.M.: A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 93(5), 249\u2013253 (2005)","journal-title":"Inf. Process. Lett."}],"container-title":["Communications in Computer and Information Science","Recent Challenges in Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5937-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T08:09:19Z","timestamp":1723450159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5937-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819759361","9789819759378"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5937-8_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ras Al Khaimah","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2024\/index.php#about","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}