{"id":"https://openalex.org/W3172736027","doi":"https://doi.org/10.1145/3568398","title":"A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence","display_name":"A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence","publication_year":2022,"publication_date":"2022-10-26","ids":{"openalex":"https://openalex.org/W3172736027","doi":"https://doi.org/10.1145/3568398","mag":"3172736027"},"language":"en","primary_location":{"id":"doi:10.1145/3568398","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3568398","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3568398","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3568398","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Saarland University and Max-Planck-Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1356-5177","affiliations":[{"raw_affiliation_string":"Saarland University and Max-Planck-Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Sorbonne Universit\u00e9, UPMC Univ Paris 06, CNRS, LIP6, Paris, France"],"raw_orcid":"https://orcid.org/0000-0002-0779-8962","affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9, UPMC Univ Paris 06, CNRS, LIP6, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004420568","display_name":"Debarati Das","orcid":"https://orcid.org/0000-0003-2232-4279"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Debarati Das","raw_affiliation_strings":["Basic Algorithm\u00a0Research Copenhagen (BARC), University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2232-4279","affiliations":[{"raw_affiliation_string":"Basic Algorithm\u00a0Research Copenhagen (BARC), University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2624,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.5793746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"19","issue":"1","first_page":"1","last_page":"24"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.7818369269371033},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.661994993686676},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6428636908531189},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5592743158340454},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.441959947347641},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4269178807735443},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4137611985206604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34688931703567505},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07740336656570435}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7818369269371033},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.661994993686676},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6428636908531189},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5592743158340454},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.441959947347641},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4269178807735443},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4137611985206604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34688931703567505},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07740336656570435},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3568398","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3568398","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3568398","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/bd1cb27d-ac8e-4b3d-aed5-20b2dcd72108","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/bd1cb27d-ac8e-4b3d-aed5-20b2dcd72108","pdf_url":"https://curis.ku.dk/ws/files/391218777/A_Linear_Time.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bringmann , K , Cohen-Addad , V & Das , D 2023 , ' A Linear-Time n 0.4 -Approximation for Longest Common Subsequence ' , ACM Transactions on Algorithms , vol. 19 , no. 1 , 9 . https://doi.org/10.1145/3568398","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3568398","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3568398","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3568398","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G7762523182","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320337079","funder_display_name":"Basic Algorithms Research Copenhagen, University of Copenhagen"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320337079","display_name":"Basic Algorithms Research Copenhagen, University of Copenhagen","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3172736027.pdf","grobid_xml":"https://content.openalex.org/works/W3172736027.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1756477312","https://openalex.org/W1764956874","https://openalex.org/W1970026646","https://openalex.org/W1987042978","https://openalex.org/W1992904575","https://openalex.org/W2012010763","https://openalex.org/W2019972981","https://openalex.org/W2027506564","https://openalex.org/W2032869782","https://openalex.org/W2038268267","https://openalex.org/W2041650430","https://openalex.org/W2044459110","https://openalex.org/W2055693471","https://openalex.org/W2071184135","https://openalex.org/W2084921767","https://openalex.org/W2092011338","https://openalex.org/W2109227373","https://openalex.org/W2130200371","https://openalex.org/W2133601898","https://openalex.org/W2162663580","https://openalex.org/W2162744351","https://openalex.org/W2178011018","https://openalex.org/W2207058206","https://openalex.org/W2775068415","https://openalex.org/W2778969291","https://openalex.org/W2782583418","https://openalex.org/W2903274221","https://openalex.org/W2963944443","https://openalex.org/W2964007110","https://openalex.org/W2971374205","https://openalex.org/W2971787908","https://openalex.org/W3002517191","https://openalex.org/W3034399032","https://openalex.org/W3034952850","https://openalex.org/W3126626577","https://openalex.org/W4232943531"],"related_works":["https://openalex.org/W1746697883","https://openalex.org/W3022573534","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W1974063126","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,7,45,53,62,66,96,101,158,164,214,241],"classic":[3],"problem":[4,69,93],"of":[5,12,15,98,216,244,256],"computing":[6],"Longest":[8],"Common":[9],"Subsequence":[10],"(LCS)":[11],"two":[13],"strings":[14],"length":[16],"n":[17,109,118,151,179,186,206,236,247],".":[18],"The":[19],"40-year-old":[20],"quadratic-time":[21],"dynamic":[22],"programming":[23],"algorithm":[24,112,145,173,225],"has":[25,51,83,120],"recently":[26],"been":[27,84,121],"shown":[28],"to":[29,55],"be":[30],"near-optimal":[31],"by":[32,135],"Abboud,":[33],"Backurs,":[34],"and":[35,39,41,139,220,253],"Vassilevska":[36],"Williams":[37],"[FOCS\u201915]":[38,43],"Bringmann":[40],"K\u00fcnnemann":[42],"assuming":[44],"Strong":[46],"Exponential":[47],"Time":[48],"Hypothesis.":[49],"This":[50],"led":[52],"community":[54],"look":[56],"for":[57,61,70,123,163,192,250],"subquadratic":[58,231],"approximation":[59,74,227],"algorithms":[60],"problem.":[63],"Yet,":[64],"unlike":[65],"edit":[67],"distance":[68],"which":[71],"a":[72,90,105,132,143,148],"constant-factor":[73],"in":[75,95,154,175,209,258],"almost-linear":[76],"time":[77,115,176,233],"is":[78],"known,":[79,122],"very":[80],"little":[81],"progress":[82],"made":[85],"on":[86],"LCS,":[87],"making":[88],"it":[89],"notoriously":[91],"difficult":[92],"also":[94],"realm":[97],"approximation.":[99],"For":[100],"general":[102],"setting,":[103],"only":[104,257],"naive":[106,159,242],"O":[107,149,177,234,245],"(":[108,117,150,178,185,205,235,246],"\u025b":[110,128,196],"/2-approximation":[111],"with":[113,189,229,261],"running":[114,232],"O\u0160":[116,184,204],"2-\u025b":[119,180,237],"any":[124,193,230,251],"constant":[125],"0":[126,194],"&lt;":[127,195],"\u2264":[129,197],"1.":[130,198],"Recently,":[131],"breakthrough":[133],"result":[134,200],"Hajiaghayi,":[136,217],"Seddighin,":[137,138,218,219],"Sun":[140],"[SODA\u201919]":[141],"provided":[142],"linear-time":[144],"that":[146,174],"yields":[147],"0.497956":[152],"-approximation":[153,162,188,208],"expectation;":[155],"improving":[156,212,239],"upon":[157,213,240],"\\(O(\\sqrt":[160],"{n})\\)":[161],"first":[165],"time.":[166],"In":[167],"this":[168],"paper,":[169],"we":[170],"provide":[171],"an":[172,183,203,224],")":[181,249],"computes":[182],"2\u025b/5":[187],"high":[190,262],"probability,":[191],"Our":[199],"(1)":[201],"gives":[202],"0.4":[207],"linear":[210],"time,":[211],"bound":[215,243],"Sun,":[221],"(2)":[222],"provides":[223],"whose":[226],"scales":[228],"),":[238],"\u025b/2":[248],"\u025b,":[252],"(3)":[254],"instead":[255],"expectation,":[259],"succeeds":[260],"probability.":[263]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}