{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T20:46:29Z","timestamp":1785876389367,"version":"3.56.0"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24A20257"],"award-info":[{"award-number":["U24A20257"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272272"],"award-info":[{"award-number":["62272272"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2027,1]]},"DOI":"10.1016\/j.ipl.2026.106658","type":"journal-article","created":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:33:46Z","timestamp":1781462026000},"page":"106658","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Longest common subsequence including at most k segments"],"prefix":"10.1016","volume":"195","author":[{"given":"Tiantian","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuefeng","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haodi","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2026.106658_bib0001","series-title":"14th Annual Symposium on Switching and Automata Theory (Swat 1973)","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"},{"issue":"1","key":"10.1016\/j.ipl.2026.106658_bib0002","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.ipl.2026.106658_bib0003","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ipl.2026.106658_bib0004","series-title":"Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000","first-page":"39","article-title":"A survey of longest common subsequence algorithms","author":"Bergroth","year":"2000"},{"issue":"2","key":"10.1016\/j.ipl.2026.106658_bib0005","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2026.106658_bib0006","series-title":"Foundations of Computer Science","first-page":"59","article-title":"Tight hardness results for LCS and other sequence similarity measures","author":"Abboud","year":"2015"},{"key":"10.1016\/j.ipl.2026.106658_bib0007","unstructured":"N.S. Nosatzki, Approximating the longest common subsequence problem within a sub-polynomial factor in linear time, (2021). arXiv preprint arXiv: 2112.08454."},{"issue":"06","key":"10.1016\/j.ipl.2026.106658_bib0008","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1142\/S0129054105003716","article-title":"A first approach to finding common motifs with gaps","volume":"16","author":"Iliopoulos","year":"2005","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20133","key":"10.1016\/j.ipl.2026.106658_bib0009","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.tcs.2006.06.029","article-title":"Longest repeats with a block of k don\u2019t cares","volume":"362","author":"Crochemore","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2026.106658_bib0010","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.tcs.2015.11.026","article-title":"LCSk: a refined similarity measure","volume":"638","author":"Benson","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2026.106658_bib0011","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.tcs.2017.05.015","article-title":"A space efficient algorithm for the longest common subsequence in k-length substrings","volume":"687","author":"Zhu","year":"2017","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.ipl.2026.106658_bib0012","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1038\/s41587-023-01793-w","article-title":"Pangenome graph construction from genome alignments with minigraph-cactus","volume":"42","author":"Hickey","year":"2024","journal-title":"Nat. Biotechnol."},{"key":"10.1016\/j.ipl.2026.106658_bib0013","series-title":"2022 IEEE International Conference on Bioinformatics and Biomedicine","first-page":"63","article-title":"Longest k-tuple common sub-strings","author":"Li","year":"2022"},{"issue":"2","key":"10.1016\/j.ipl.2026.106658_bib0014","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.jda.2009.12.001","article-title":"On the complexity of finding gapped motifs","volume":"8","author":"Michael","year":"2010","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.ipl.2026.106658_bib0015","series-title":"International Workshop on Frontiers in Algorithmics","first-page":"106","article-title":"Longest (k]-tuple common substrings","author":"Li","year":"2024"},{"key":"10.1016\/j.ipl.2026.106658_bib0016","series-title":"Latin American Symposium on Theoretical Informatics","first-page":"88","article-title":"The LCA problem revisited","author":"Bender","year":"2000"},{"key":"10.1016\/j.ipl.2026.106658_bib0017","series-title":"International Conference on Algorithms and Complexity","first-page":"136","article-title":"Subsequence matching and LCS with segment number constraints","author":"Yonemoto","year":"2025"},{"key":"10.1016\/j.ipl.2026.106658_bib0018","series-title":"International Symposium on String Processing and Information Retrieval","first-page":"143","article-title":"Quantum algorithms for longest common substring with a gap","author":"Gibney","year":"2024"},{"key":"10.1016\/j.ipl.2026.106658_bib0019","series-title":"32nd Annual European Symposium on Algorithms","first-page":"16:1","article-title":"Longest common substring with gaps and related problems","author":"Banerjee","year":"2024"},{"key":"10.1016\/j.ipl.2026.106658_bib0020","series-title":"International Conference on Intelligent Computing","first-page":"469","article-title":"Enough consecutive matches in k-tuple common substrings","author":"Li","year":"2025"},{"key":"10.1016\/j.ipl.2026.106658_bib0021","series-title":"International Computing and Combinatorics Conference","first-page":"355","article-title":"Longest double-bounded (k]-tuple common substrings","author":"Li","year":"2025"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019026000396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019026000396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T20:01:03Z","timestamp":1785873663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019026000396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":21,"alternative-id":["S0020019026000396"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106658","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Longest common subsequence including at most k segments","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106658","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106658"}}