{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:08:45Z","timestamp":1757621325536,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502172"},{"type":"electronic","value":"9789819502189"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0218-9_26","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:35Z","timestamp":1754168975000},"page":"355-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Longest Double-Bounded (k]-Tuple Common Substrings"],"prefix":"10.1007","author":[{"given":"Tiantian","family":"Li","sequence":"first","affiliation":[]},{"given":"Siqi","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Backurs, A., Williams, V.V.: Tight hardness results for LCS and other sequence similarity measures. In: Foundations of Computer Science. pp. 59\u201378. IEEE (2015)","DOI":"10.1109\/FOCS.2015.14"},{"issue":"12","key":"26_CR2","doi-asserted-by":"publisher","first-page":"3707","DOI":"10.1007\/s00453-020-00744-0","volume":"82","author":"A Amir","year":"2020","unstructured":"Amir, A., Charalampopoulos, P., Pissis, S.P., Radoszewski, J.: Dynamic and internal longest common substring. Algorithmica 82(12), 3707\u20133743 (2020)","journal-title":"Algorithmica"},{"key":"26_CR3","unstructured":"Banerjee, A., Gibney, D., Thankachan, S.V.: Longest common substring with gaps and related problems. In: 32nd Annual European Symposium on Algorithms (ESA 2024). pp. 16:1\u201316:18. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tcs.2015.11.026","volume":"638","author":"G Benson","year":"2016","unstructured":"Benson, G., Levy, A., Maimoni, S., Noifeld, D., Shalom, B.R.: LCSk: a refined similarity measure. Theoret. Comput. Sci. 638, 11\u201326 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Benson, G., Levy, A., Shalom, B.R.: Longest common subsequence in k length substrings. In: Similarity Search and Applications: 6th International Conference. pp. 257\u2013265. Springer (2013)","DOI":"10.1007\/978-3-642-41062-8_26"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1186\/s13059-021-02319-w","volume":"22","author":"BJ Fremin","year":"2021","unstructured":"Fremin, B.J., Bhatt, A.S.: Comparative genomics identifies thousands of candidate structured RNAs in human microbiomes. Genome Biol. 22(1), 100\u2013100 (2021)","journal-title":"Genome Biol."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"6","key":"26_CR8","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":"26_CR9","doi-asserted-by":"crossref","unstructured":"Li, T., Jiang, H., Wang, L., Zhu, D.: Longest (k]-tuple common substrings. In: International Workshop on Frontiers in Algorithmics. pp. 106\u2013114. Singapore: Springer Nature Singapore (2024)","DOI":"10.1007\/978-981-97-7752-5_8"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Li, T., Zhu, D., Jiang, H., Feng, H., Cui, X.: Longest k-tuple common sub-strings. In: 2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). pp. 63\u201366. IEEE (2022)","DOI":"10.1109\/BIBM55620.2022.9995199"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jda.2009.12.001","volume":"8","author":"M Michael","year":"2010","unstructured":"Michael, M., Nicolas, F., Ukkonen, E.: On the complexity of finding gapped motifs. Journal of Discrete Algorithms 8(2), 131\u2013142 (2010)","journal-title":"Journal of Discrete Algorithms"},{"issue":"18","key":"26_CR13","doi-asserted-by":"publisher","first-page":"i333","DOI":"10.1093\/bioinformatics\/bts378","volume":"28","author":"T Rausch","year":"2012","unstructured":"Rausch, T., Zichner, T., Schlattl, A., St\u00fctz, A.M., Benes, V., Korbel, J.O.: Delly: structural variant discovery by integrated paired-end and split-read analysis. Bioinformatics 28(18), i333\u2013i339 (2012)","journal-title":"Bioinformatics"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM (JACM) 21(1), 168\u2013173 (1974)","journal-title":"Journal of the ACM (JACM)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Yonemoto, Y., Mieno, T., Inenaga, S., Yoshinaka, R., Shinohara, A.: Subsequence matching and LCS with segment number constraints. arXiv preprint arXiv:2407.19796 (2025)","DOI":"10.1007\/978-3-031-92935-9_9"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2017.05.015","volume":"687","author":"D Zhu","year":"2017","unstructured":"Zhu, D., Wang, L., Wang, T., Wang, X.: A space efficient algorithm for the longest common subsequence in k-length substrings. Theoret. Comput. Sci. 687, 79\u201392 (2017)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0218-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:42:09Z","timestamp":1757335329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}