{"id":"https://openalex.org/W4281704174","doi":"https://doi.org/10.1145/3519935.3519990","title":"Almost-optimal sublinear-time edit distance in the low distance regime","display_name":"Almost-optimal sublinear-time edit distance in the low distance regime","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281704174","doi":"https://doi.org/10.1145/3519935.3519990"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3519990","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519990","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519990","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519990","any_repository_has_fulltext":null},"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":true,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Saarland University, Germany / MPI-INF, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Germany / MPI-INF, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030781741","display_name":"Alejandro Cassis","orcid":null},"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":"Alejandro Cassis","raw_affiliation_strings":["Saarland University, Germany / MPI-INF, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Germany / MPI-INF, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102833378","display_name":"Nick Fischer","orcid":"https://orcid.org/0009-0001-0909-3296"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]},{"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"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nick Fischer","raw_affiliation_strings":["Saarland University, Germany / MPI-INF, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Germany / MPI-INF, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054359620","display_name":"Vasileios Nakos","orcid":"https://orcid.org/0000-0003-2703-2750"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vasileios Nakos","raw_affiliation_strings":["RelationalAI, USA"],"affiliations":[{"raw_affiliation_string":"RelationalAI, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044394587"],"corresponding_institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":0.5307,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70010355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1102","last_page":"1115"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9980999827384949,"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/T11567","display_name":"semigroups and automata theory","score":0.9902999997138977,"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/edit-distance","display_name":"Edit distance","score":0.9451297521591187},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.9011213779449463},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7154892086982727},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5796116590499878},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5061995387077332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4600372910499573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3620387315750122},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32593756914138794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3001905381679535},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07047262787818909}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.9451297521591187},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.9011213779449463},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7154892086982727},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5796116590499878},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5061995387077332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4600372910499573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3620387315750122},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32593756914138794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3001905381679535},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07047262787818909},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3519990","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519990","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519990","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3519935.3519990","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519990","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519990","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4281704174.pdf","grobid_xml":"https://content.openalex.org/works/W4281704174.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1647671624","https://openalex.org/W1764956874","https://openalex.org/W1968570655","https://openalex.org/W1970026646","https://openalex.org/W1985108724","https://openalex.org/W1990061958","https://openalex.org/W1991099830","https://openalex.org/W2019972981","https://openalex.org/W2032869782","https://openalex.org/W2055693471","https://openalex.org/W2074707165","https://openalex.org/W2078993594","https://openalex.org/W2133601898","https://openalex.org/W2162663580","https://openalex.org/W2178011018","https://openalex.org/W2207058206","https://openalex.org/W2664802502","https://openalex.org/W2888157438","https://openalex.org/W2971787908","https://openalex.org/W3034399032","https://openalex.org/W3045093866","https://openalex.org/W3097495782","https://openalex.org/W3126626577","https://openalex.org/W3128132474","https://openalex.org/W4232943531"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2052708136","https://openalex.org/W2809723425","https://openalex.org/W2005302727","https://openalex.org/W4289097813","https://openalex.org/W3082028334","https://openalex.org/W1973725449"],"abstract_inverted_index":{"We":[0],"revisit":[1],"the":[2,6,13,30,67,80,91,96],"task":[3,31],"of":[4,26,79,87],"computing":[5],"edit":[7,15,37],"distance":[8,16,38],"in":[9,73,84],"sublinear":[10],"time.":[11],"In":[12],"(k,K)-gap":[14],"problem":[17,69],"we":[18],"are":[19],"given":[20],"oracle":[21],"access":[22],"to":[23,33],"two":[24],"strings":[25],"length":[27],"n":[28],"and":[29,54,62],"is":[32,39,89,93],"distinguish":[34],"whether":[35,90],"their":[36],"at":[40,44],"most":[41,81],"k":[42],"or":[43],"least":[45],"K.":[46],"It":[47],"has":[48],"been":[49],"established":[50],"by":[51,60],"Goldenberg,":[52],"Krauthgamer":[53],"Saha":[55,63],"(FOCS":[56,64],"\u201919),":[57],"with":[58],"improvements":[59],"Kociumaka":[61],"\u201920),":[65],"that":[66],"(k,k2)-gap":[68,92],"can":[70],"be":[71],"solved":[72],"time":[74,98],"O(n/k":[75,99],"+":[76,100],"poly(k)).":[77,101],"One":[78],"natural":[82],"questions":[83],"this":[85],"line":[86],"research":[88],"best-possible":[94],"for":[95],"running":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}