{"id":"https://openalex.org/W4293037332","doi":"https://doi.org/10.1137/19m1272068","title":"Approximating Longest Common Subsequence in Linear Time: Beating the $\\sqrt{{n}}$ Barrier","display_name":"Approximating Longest Common Subsequence in Linear Time: Beating the $\\sqrt{{n}}$ Barrier","publication_year":2022,"publication_date":"2022-08-01","ids":{"openalex":"https://openalex.org/W4293037332","doi":"https://doi.org/10.1137/19m1272068"},"language":"en","primary_location":{"id":"doi:10.1137/19m1272068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1272068","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"MohammadTaghi HajiAghayi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000823457","display_name":"Masoud Seddighin","orcid":"https://orcid.org/0000-0003-1089-5779"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Masoud Seddighin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013129972","display_name":"Saeedreza Seddighin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saeedreza Seddighin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101033892","display_name":"Xiaorui Sun","orcid":"https://orcid.org/0009-0003-8914-2514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaorui Sun","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111876448"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08290122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"4","first_page":"1341","last_page":"1367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11567","display_name":"semigroups and automata theory","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7385317087173462},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6796680688858032},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.677613377571106},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6669924259185791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5563075542449951},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5125762820243835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3315216302871704},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07578682899475098}],"concepts":[{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7385317087173462},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6796680688858032},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.677613377571106},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6669924259185791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5563075542449951},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5125762820243835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3315216302871704},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07578682899475098},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m1272068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1272068","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1482862754","https://openalex.org/W1756652108","https://openalex.org/W1764956874","https://openalex.org/W1948141881","https://openalex.org/W1969844791","https://openalex.org/W1974708980","https://openalex.org/W1992904575","https://openalex.org/W2003021193","https://openalex.org/W2012010763","https://openalex.org/W2027506564","https://openalex.org/W2032869782","https://openalex.org/W2038268267","https://openalex.org/W2041650430","https://openalex.org/W2045821558","https://openalex.org/W2055693471","https://openalex.org/W2088055539","https://openalex.org/W2109227373","https://openalex.org/W2137939491","https://openalex.org/W2162663580","https://openalex.org/W2162744351","https://openalex.org/W2165654401","https://openalex.org/W2207058206","https://openalex.org/W2330868067","https://openalex.org/W2964007110","https://openalex.org/W2964082996","https://openalex.org/W2971374205","https://openalex.org/W2998685384","https://openalex.org/W4232943531","https://openalex.org/W4240117647","https://openalex.org/W4254807835"],"related_works":["https://openalex.org/W4225349735","https://openalex.org/W4301184965","https://openalex.org/W2075403678","https://openalex.org/W2964011774","https://openalex.org/W170643605","https://openalex.org/W776417157","https://openalex.org/W1537453950","https://openalex.org/W3208750826","https://openalex.org/W2485265215","https://openalex.org/W4290493705"],"abstract_inverted_index":{"Longest":[0],"common":[1],"subsequence":[2],"(LCS)":[3],"is":[4,70,95,100,146],"one":[5],"of":[6,159],"the":[7,47,119,133,152,165],"most":[8],"fundamental":[9],"problems":[10],"in":[11,22,38,59,90,101,118,140,161,171],"combinatorial":[12],"optimization.":[13],"Apart":[14,78],"from":[15,79],"theoretical":[16],"importance,":[17],"LCS":[18,37,69,139,153,170],"has":[19,42,155],"enormous":[20],"applications":[21],"bioinformatics,":[23],"revision":[24],"control":[25],"systems,":[26],"and":[27,54],"data":[28],"comparison":[29],"programs.":[30],"Although":[31],"a":[32,50,80,147],"simple":[33],"dynamic":[34],"program":[35],"computes":[36],"quadratic":[39],"time,":[40],"it":[41],"been":[43],"recently":[44],"proven":[45],"that":[46,84],"problem":[48,107],"admits":[49],"conditional":[51],"lower":[52],"bound":[53],"may":[55],"not":[56],"be":[57],"solved":[58],"truly":[60],"subquadratic":[61],"time":[62,91,114,149],"[2,":[63],"18].":[64],"In":[65,128],"addition":[66],"to":[67,75,104],"this,":[68],"notoriously":[71],"hard":[72],"with":[73],"respect":[74],"approximation":[76,88,157],"algorithms.":[77],"trivial":[81],"sampling":[82],"technique":[83],"obtains":[85],"an":[86,156],"$n^{x}$":[87],"solution":[89],"$O(n^{2-2x})$":[92],"nothing":[93],"else":[94],"known":[96],"for":[97,110,137,151,168],"LCS.":[98],"This":[99,163],"sharp":[102],"contrast":[103],"its":[105],"dual":[106],"edit":[108],"distance,":[109],"which":[111,154],"several":[112],"linear":[113,141,148,172],"solutions":[115],"were":[116],"obtained":[117],"past":[120],"two":[121],"decades":[122],"[5,":[123],"6,":[124],"10,":[125],"11,":[126],"19].":[127],"this":[129],"work,":[130],"we":[131],"present":[132],"first":[134],"nontrivial":[135],"algorithm":[136,150],"approximating":[138,169],"time.":[142,173],"Our":[143],"main":[144],"result":[145],"factor":[158],"$O(n^{0.4991319})$":[160],"expectation.":[162],"beats":[164],"$\\sqrt{n}$":[166],"barrier":[167]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}