{"id":"https://openalex.org/W4416378727","doi":"https://doi.org/10.4230/lipics.itcs.2026.78","title":"Hardness of Dynamic Tree Edit Distance and Friends","display_name":"Hardness of Dynamic Tree Edit Distance and Friends","publication_year":2025,"publication_date":"2025-11-13","ids":{"openalex":"https://openalex.org/W4416378727","doi":"https://doi.org/10.4230/lipics.itcs.2026.78"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25365","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.78","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.78","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101280317","display_name":"Bingbing Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Bingbing","raw_affiliation_strings":["University of California San Diego, La Jolla, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8854-5969","affiliations":[{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084429927","display_name":"Jakob Nogler","orcid":"https://orcid.org/0009-0002-7028-2595"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nogler, Jakob","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0009-0002-7028-2595","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110611660","display_name":"Barna Saha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saha, Barna","raw_affiliation_strings":["University of California San Diego, La Jolla, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-6494-3839","affiliations":[{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3332905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9218000173568726,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9218000173568726,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.017100000753998756,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.016200000420212746,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.9577000141143799},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5863999724388123},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5302000045776367},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5199999809265137},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4237000048160553},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3797999918460846},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.33239999413490295}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.9577000141143799},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5863999724388123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5479999780654907},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5302000045776367},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5199999809265137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4997999966144562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4830000102519989},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43149998784065247},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4237000048160553},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3418000042438507},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.33239999413490295},{"id":"https://openalex.org/C2776545253","wikidata":"https://www.wikidata.org/wiki/Q5464292","display_name":"Folding (DSP implementation)","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28999999165534973},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.25769999623298645},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25365","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.78","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:arXiv.org:2511.09842","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.09842","pdf_url":"https://arxiv.org/pdf/2511.09842","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.09842","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.09842","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.itcs.2026.78","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2026.78","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:drops-oai.dagstuhl.de:25365","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.78","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"String":[0,203],"Edit":[1,108,111,147,150,189,204,209],"Distance":[2,190,205],"is":[3,20,78,122,219],"a":[4,79,181],"more-than-classical":[5],"problem":[6],"whose":[7,212],"behavior":[8],"in":[9,32,215],"the":[10,14,54,83,132,166,171,192,197,216],"dynamic":[11,126,157,201],"setting,":[12],"where":[13],"strings":[15],"are":[16,39,56,94],"updated":[17],"over":[18,82,131],"time,":[19],"well":[21],"studied.":[22],"A":[23],"single-character":[24],"substitution,":[25],"insertion,":[26],"or":[27,91],"deletion":[28],"can":[29],"be":[30],"processed":[31],"time":[33,69],"$\\tilde{\\mathcal{O}}(n":[34,67],"w)$":[35],"when":[36,87,92],"operation":[37],"costs":[38],"positive":[40],"integers":[41],"bounded":[42],"by":[43,142],"$w$":[44],"[Charalampopoulos,":[45,72],"Kociumaka,":[46,50,73],"Mozes,":[47,74],"CPM":[48,75],"2020][Gorbachev,":[49],"STOC":[51],"2025].":[52],"If":[53],"weights":[55],"further":[57],"uniform":[58,97],"(insertions":[59],"and":[60,113,152,206],"deletions":[61],"have":[62],"equal":[63],"cost),":[64],"also":[65],"an":[66,129],"\\sqrt{n})$-update":[68],"algorithm":[70,86,169],"exists":[71],"2020].":[76],"This":[77,195],"substantial":[80],"improvement":[81],"static":[84,133,217],"$\\mathcal{O}(n^2)$":[85],"$w":[88],"\\ll":[89],"n$":[90],"we":[93,138,163,179],"dealing":[95],"with":[96,128],"weights.":[98],"In":[99,135],"contrast,":[100],"for":[101,186],"inherently":[102],"related":[103],"problems":[104,211],"such":[105],"as":[106],"Tree":[107,146,188,208],"Distance,":[109,112,148,151,210],"Dyck":[110,149],"RNA":[114,153],"Folding,":[115],"it":[116,121],"has":[117],"remained":[118],"unknown":[119],"whether":[120],"possible":[123,168],"to":[124],"devise":[125],"algorithms":[127],"advantage":[130],"algorithm.":[134],"this":[136,140],"paper,":[137],"resolve":[139],"question":[141],"showing":[143],"that":[144,165],"(weighted)":[145],"Folding":[154],"admit":[155],"no":[156],"speedup:":[158],"under":[159,191],"well-known":[160],"fine-grained":[161],"assumptions":[162],"show":[164],"best":[167],"recomputes":[170],"solution":[172],"from":[173],"scratch":[174],"after":[175],"each":[176],"update.":[177],"Furthermore,":[178],"prove":[180],"quadratic":[182],"per-update":[183],"lower":[184],"bound":[185],"unweighted":[187,202,207],"$k$-Clique":[193],"Conjecture.":[194],"provides":[196],"first":[198],"separation":[199],"between":[200],"relative":[213],"difficulty":[214],"setting":[218],"still":[220],"open.":[221]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-15T00:00:00"}