{"id":"https://openalex.org/W4415368223","doi":"https://doi.org/10.1109/isit63088.2025.11195592","title":"Improved Lower Bounds on the Expected Length of Longest Common Subsequences","display_name":"Improved Lower Bounds on the Expected Length of Longest Common Subsequences","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368223","doi":"https://doi.org/10.1109/isit63088.2025.11195592"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104631597","display_name":"Duncan Soiffer","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Duncan Soiffer","raw_affiliation_strings":["Carnegie Mellon University,Department of Machine Learning,Pittsburgh,PA,USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Department of Machine Learning,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104631596","display_name":"Andrew Salls","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Salls","raw_affiliation_strings":["Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105940668","display_name":"Chase Miller","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chase Miller","raw_affiliation_strings":["Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081855980","display_name":"Daniel Reichman","orcid":"https://orcid.org/0000-0003-0566-7528"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Reichman","raw_affiliation_strings":["Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087999366","display_name":"G\u00e1bor N. S\u00e1rk\u00f6zy","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G\u00e1bor S\u00e1rk\u00f6zy","raw_affiliation_strings":["Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028511054","display_name":"George T. Heineman","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George Heineman","raw_affiliation_strings":["Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Department of Computer Science,Worcester,MA,USA","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5104631597"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16451179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9562000036239624,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.7139999866485596},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6973000168800354},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6743000149726868},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5884000062942505},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5378000140190125},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.515999972820282},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47380000352859497}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.7139999866485596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7139000296592712},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6973000168800354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6847000122070312},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6743000149726868},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5884000062942505},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5378000140190125},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.515999972820282},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47380000352859497},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41429999470710754},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30799999833106995},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.28870001435279846},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1490430289","https://openalex.org/W1551519020","https://openalex.org/W1604824775","https://openalex.org/W1988684690","https://openalex.org/W1988706090","https://openalex.org/W1991983464","https://openalex.org/W2012010763","https://openalex.org/W2017702642","https://openalex.org/W2024817899","https://openalex.org/W2029456884","https://openalex.org/W2040820014","https://openalex.org/W2052469352","https://openalex.org/W2089710149","https://openalex.org/W2091419774","https://openalex.org/W2093355963","https://openalex.org/W2099591940","https://openalex.org/W2500470525","https://openalex.org/W2994471749","https://openalex.org/W3001034374","https://openalex.org/W4235512468","https://openalex.org/W4246262524","https://openalex.org/W4300134530"],"related_works":[],"abstract_inverted_index":{"It":[0],"is":[1,71],"known":[2,61],"that,":[3],"when":[4,131],"normalized":[5],"by":[6],"<tex":[7,11,25,32,40,51,55,113],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[8,12,26,33,41,52,56,114],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[9,34],"as":[10,62],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n":[13],"\\rightarrow":[14],"\\infty$</tex>,":[15],"the":[16,63,82,128,133,137],"expected":[17],"length":[18,31],"of":[19,24,30,38,110,135,139],"a":[20,45,72,105],"longest":[21],"common":[22],"subsequence":[23],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d$</tex>":[27,53],"random":[28],"strings":[29],"over":[35],"an":[36,93],"alphabet":[37],"size":[39,134],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\sigma$</tex>":[42],"converges":[43],"to":[44],"constant":[46],"that":[47],"depends":[48],"only":[49],"on":[50,77],"and":[54,66,91,98],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\sigma$</tex>.":[57],"These":[58],"values":[59,70],"are":[60,143],"Chv\u00e1tal-Sankoff":[64,129],"constants,":[65,83],"determining":[67],"their":[68],"exact":[69],"major":[73],"open":[74],"problem.":[75],"Building":[76],"previous":[78],"algorithms":[79],"for":[80,112,127],"lower-bounding":[81],"we":[84,103],"implement":[85],"parallelization,":[86],"introduce":[87],"significant":[88],"runtime":[89],"optimizations,":[90],"design":[92],"efficient":[94],"recursive":[95],"memory":[96],"reading":[97],"writing":[99],"scheme.":[100],"With":[101],"this,":[102],"obtain":[104],"new":[106],"best":[107],"lower":[108,125],"bound":[109],"0.792665992":[111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\sigma=2,":[115],"d=2$</tex>.":[116],"We":[117],"additionally":[118],"improve":[119],"upon":[120],"almost":[121],"all":[122],"previously":[123],"reported":[124],"bounds":[126],"constants":[130],"either":[132],"alphabet,":[136],"number":[138],"strings,":[140],"or":[141],"both":[142],"larger":[144],"than":[145],"2.":[146]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}