{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:16Z","timestamp":1773376996465,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195592","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Improved Lower Bounds on the Expected Length of Longest Common Subsequences"],"prefix":"10.1109","author":[{"given":"Duncan","family":"Soiffer","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Department of Machine Learning,Pittsburgh,PA,USA"}]},{"given":"Andrew","family":"Salls","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"}]},{"given":"Chase","family":"Miller","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"}]},{"given":"Daniel","family":"Reichman","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"}]},{"given":"G\u00e1bor","family":"S\u00e1rk\u00f6zy","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"}]},{"given":"George","family":"Heineman","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400835386","volume-title":"Dynamic Programming","author":"Bellman","year":"2010"},{"key":"ref2","article-title":"Algorithms","author":"Dasgupta","year":"2006","journal-title":"McGraw-Hill Education"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2020.2968323"},{"issue":"1","key":"ref4","doi-asserted-by":"crossref","first-page":"159164","DOI":"10.1016\/0022-2836(73)90369-0","article-title":"A test for nucleotide sequence homology","volume":"77","author":"Sankoff","year":"1973","journal-title":"Journal of Molecular Biology"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSIT.2010.5563974"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IC3.2014.6897176"},{"key":"ref7","article-title":"algorithm for differential file comparison","author":"Hunt","year":"1976","journal-title":"Bell Laboratories Murray Hill"},{"issue":"8","key":"ref8","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"issue":"1","key":"ref9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"ref10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.2307\/3212444","article-title":"Longest common subsequences of two random sequences","volume":"12","author":"Chv\u00e1tal","year":"1975","journal-title":"Journal of Applied Probability"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/s0963548309009900"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2022.001.0001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970029"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1201\/9780203750131"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516519"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_180"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000125"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1158685004"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/21-aap1709"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743594"},{"key":"ref22","volume-title":"Improved lower bounds on the expected length of longest common subsequences","author":"Heineman","year":"2024"},{"issue":"1","key":"ref23","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(79)90057-8","article-title":"Some limit results for longest common subsequences","volume":"26","author":"Deken","year":"1979","journal-title":"Discrete Mathematics"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176349952"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s100510050616"},{"key":"ref26","volume-title":"Expected length of longest common subsequences","author":"Dan\u010d\u00edk","year":"1994"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/S096354839800368X"},{"key":"ref28","article-title":"Upper bounds on the average edit distance between two random strings","author":"Rosenfeld","year":"2024","journal-title":"arXiv preprint arXiv"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195592.pdf?arnumber=11195592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:52Z","timestamp":1773347392000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195592\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195592","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}