{"id":"https://openalex.org/W4226078789","doi":"https://doi.org/10.4230/lipics.cpm.2026.27","title":"Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time","display_name":"Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time","publication_year":2021,"publication_date":"2021-12-15","ids":{"openalex":"https://openalex.org/W4226078789","doi":"https://doi.org/10.4230/lipics.cpm.2026.27"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2112.08454","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2112.08454","pdf_url":"https://arxiv.org/pdf/2112.08454","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2112.08454","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091285415","display_name":"Negev Shekel Nosatzki","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nosatzki, Negev Shekel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091285415"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2799,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66577719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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.9995999932289124,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9861999750137329,"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.9029197692871094},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7415767908096313},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6894926428794861},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6813347339630127},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5890915989875793},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5866777896881104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5198802947998047},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4795372486114502},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4511718153953552},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4354930818080902},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42964833974838257},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4259242117404938},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3883996605873108},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.3873906433582306},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24897971749305725}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9029197692871094},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7415767908096313},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6894926428794861},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6813347339630127},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5890915989875793},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5866777896881104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5198802947998047},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4795372486114502},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4511718153953552},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4354930818080902},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42964833974838257},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4259242117404938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3883996605873108},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.3873906433582306},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24897971749305725},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2112.08454","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2112.08454","pdf_url":"https://arxiv.org/pdf/2112.08454","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25953","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.27/LIPIcs.CPM.2026.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.48550/arxiv.2112.08454","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2112.08454","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.cpm.2026.27","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.27","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2112.08454","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2112.08454","pdf_url":"https://arxiv.org/pdf/2112.08454","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605","https://openalex.org/W3094761360"],"abstract_inverted_index":{"The":[0,23,57],"Longest":[1,8,52],"Common":[2,9,53],"Subsequence":[3],"(LCS)":[4],"problem":[5,12,59,202],"and":[6,20,73,83,102,127,252,262,270],"the":[7,34,51,61,77,90,97,103,123,137,140,161,177,181,184,200,206,256,264,274],"Substring":[10],"(LCStr)":[11],"are":[13],"classical":[14,278],"string":[15,63,72,260,279],"problems":[16,224,261],"with":[17],"broad":[18],"theoretical":[19,257],"practical":[21],"significance.":[22],"former":[24],"has":[25],"a":[26,37,45,67,74,114,154,169,197,234],"quadratic":[27,104],"conditional":[28],"lower":[29],"bound":[30],"[FOCS,":[31],"2015],":[32],"while":[33],"latter":[35],"admits":[36],"linear-time":[38,155],"solution.":[39],"In":[40,150],"this":[41],"paper,":[42],"we":[43,152,167,187],"study":[44],"natural":[46,115],"variation":[47],"of":[48,69,76,92,100,106,117,143,176,183,193,199,259],"these":[49],"problems,":[50,166],"Subsequence-Substring":[54],"(LCSS)":[55],"problem.":[56,178],"LCSS":[58,94,118,144,185,243],"seeks":[60],"longest":[62],"that":[64,215],"is":[65,145],"simultaneously":[66],"subsequence":[68,126,251],"one":[70],"input":[71],"substring":[75,128,253],"other.":[78],"This":[79,232],"variant":[80,198],"bridges":[81],"LCS":[82,201,208],"LCStr,":[84],"raising":[85],"intriguing":[86],"algorithmic":[87,268],"questions:":[88],"Does":[89],"complexity":[91,142,182],"computing":[93],"interpolate":[95],"between":[96,125,250,277],"linear":[98],"time":[99,105],"LCStr":[101],"LCS?":[107],"What":[108],"about":[109],"approximability?":[110],"We":[111],"also":[112],"examine":[113],"extension":[116],"to":[119,148,189],"multiple":[120],"strings,":[121],"parameterizing":[122],"balance":[124],"requirements.":[129],"Our":[130,212],"results":[131],"reveal":[132],"several":[133],"insights.":[134],"First,":[135],"under":[136],"SETH":[138],"conjecture,":[139],"inherent":[141],"quadratic,":[146],"similar":[147],"LCS.":[149],"contrast,":[151],"provide":[153],"approximation":[156],"for":[157,160,266],"LCSS.":[158],"Finally,":[159],"multi-string":[162],"variant,":[163],"unlike":[164],"both":[165],"design":[168],"quadratic-time":[170],"algorithm,":[171],"uncovering":[172],"deeper":[173],"structural":[174],"properties":[175],"By":[179],"studying":[180],"problem,":[186],"aim":[188],"gain":[190],"some":[191],"understanding":[192,258],"what":[194],"influences":[195],"whether":[196],"behaves":[203],"more":[204,226],"like":[205,210],"standard":[207],"or":[209],"LCStr.":[211],"findings":[213],"suggest":[214],"hybrid":[216],"constraints":[217],"can":[218],"create":[219],"computational":[220],"\"sweet":[221],"spots,\"":[222],"where":[223],"become":[225],"tractable":[227],"than":[228],"their":[229],"pure":[230],"counterparts.":[231],"opens":[233],"broader":[235],"research":[236],"direction":[237],"in":[238,273],"constraint-mediated":[239],"algorithm":[240],"design.":[241],"Beyond":[242],"itself,":[244],"our":[245],"work":[246],"highlights":[247],"unexpected":[248],"connections":[249],"constraints,":[254],"advancing":[255],"laying":[263],"foundation":[265],"new":[267],"techniques":[269],"complexity-theoretic":[271],"insights":[272],"rich":[275],"space":[276],"comparison":[280],"paradigms.":[281]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2022-05-05T00:00:00"}