{"id":"https://openalex.org/W2028509346","doi":"https://doi.org/10.1145/2699485","title":"Efficient Computation of the Tree Edit Distance","display_name":"Efficient Computation of the Tree Edit Distance","publication_year":2015,"publication_date":"2015-03-25","ids":{"openalex":"https://openalex.org/W2028509346","doi":"https://doi.org/10.1145/2699485","mag":"2028509346"},"language":"en","primary_location":{"id":"doi:10.1145/2699485","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2699485","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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 Database Systems","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/A5102713203","display_name":"Mateusz Pawlik","orcid":"https://orcid.org/0000-0003-0543-6332"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Mateusz Pawlik","raw_affiliation_strings":["University of Salzburg, Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089328860","display_name":"Nikolaus Augsten","orcid":"https://orcid.org/0000-0002-3036-6201"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Nikolaus Augsten","raw_affiliation_strings":["University of Salzburg, Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102713203"],"corresponding_institution_ids":["https://openalex.org/I182212641"],"apc_list":null,"apc_paid":null,"fwci":7.3698,"has_fulltext":false,"cited_by_count":126,"citation_normalized_percentile":{"value":0.97335456,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"40","issue":"1","first_page":"1","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9972000122070312,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.8616795539855957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7964497804641724},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6981041431427002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5122941732406616},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4928145706653595},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4897806644439697},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4677664637565613},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42898499965667725},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4188617169857025},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4184650480747223},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.41644665598869324},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4124705195426941},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3896692395210266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18835067749023438},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.1864038109779358},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1711791455745697},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09767773747444153}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.8616795539855957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7964497804641724},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6981041431427002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5122941732406616},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4928145706653595},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4897806644439697},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4677664637565613},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42898499965667725},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4188617169857025},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4184650480747223},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.41644665598869324},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4124705195426941},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3896692395210266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18835067749023438},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.1864038109779358},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1711791455745697},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09767773747444153},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2699485","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2699485","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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 Database Systems","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":37,"referenced_works":["https://openalex.org/W113254022","https://openalex.org/W1533928757","https://openalex.org/W1539735287","https://openalex.org/W1546997823","https://openalex.org/W1605903931","https://openalex.org/W1861221087","https://openalex.org/W1973298440","https://openalex.org/W1975009259","https://openalex.org/W1976373002","https://openalex.org/W1978478796","https://openalex.org/W1978872422","https://openalex.org/W1986037284","https://openalex.org/W1988714735","https://openalex.org/W1996186909","https://openalex.org/W2003889154","https://openalex.org/W2018206665","https://openalex.org/W2018804864","https://openalex.org/W2024797550","https://openalex.org/W2028476268","https://openalex.org/W2033629528","https://openalex.org/W2034330494","https://openalex.org/W2043795882","https://openalex.org/W2057294899","https://openalex.org/W2065110301","https://openalex.org/W2082317627","https://openalex.org/W2085533860","https://openalex.org/W2107412086","https://openalex.org/W2108584692","https://openalex.org/W2108730513","https://openalex.org/W2114642041","https://openalex.org/W2128381480","https://openalex.org/W2129595335","https://openalex.org/W2136393336","https://openalex.org/W2152593687","https://openalex.org/W2164501930","https://openalex.org/W2171643895","https://openalex.org/W4255005259"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W2359095153","https://openalex.org/W1559350420","https://openalex.org/W2083751087","https://openalex.org/W2156833871","https://openalex.org/W2566588687","https://openalex.org/W1521720839","https://openalex.org/W2150988524","https://openalex.org/W1529499406","https://openalex.org/W1540916342"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,15,32,43,51,85,111,114,143,164,190],"classical":[3],"tree":[4,25,33,63,95,166],"edit":[5,20,34,96,167],"distance":[6,35,97,168],"between":[7,84],"ordered":[8],"labelled":[9],"trees,":[10],"which":[11,160],"is":[12,78,105,125,132,147],"defined":[13],"as":[14],"minimum-cost":[16],"sequence":[17],"of":[18,102,113],"node":[19],"operations":[21],"that":[22,121,140,153],"transform":[23],"one":[24],"into":[26],"another.":[27],"The":[28,39,99],"state-of-the-art":[29],"solutions":[30],"for":[31,61,67,117],"are":[36,58],"not":[37],"satisfactory.":[38],"main":[40],"competitors":[41,116],"in":[42,171],"field":[44],"either":[45],"have":[46],"optimal":[47,149],"worst-case":[48,129],"complexity":[49,101,112],"but":[50,65],"worst":[52],"case":[53],"happens":[54],"frequently,":[55],"or":[56,108],"they":[57],"very":[59],"efficient":[60,127],"some":[62],"shapes":[64],"degenerate":[66],"others.":[68],"This":[69,131],"leads":[70],"to":[71,82,110,189],"unpredictable":[72],"and":[73,128,163,178,186],"often":[74],"infeasible":[75],"runtimes.":[76],"There":[77],"no":[79],"obvious":[80],"way":[81],"choose":[83],"algorithms.":[86],"In":[87,173],"this":[88],"article":[89],"we":[90,181],"present":[91],"RTED,":[92],"a":[93,136],"robust":[94],"algorithm.":[98],"asymptotic":[100],"our":[103,123,174,184],"algorithm":[104,124],"smaller":[106],"than":[107],"equal":[109],"best":[115],"any":[118],"input":[119,144],"instance,":[120],"is,":[122],"both":[126],"optimal.":[130],"achieved":[133],"by":[134],"computing":[135],"dynamic":[137],"decomposition":[138],"strategy":[139],"depends":[141],"on":[142,176],"trees.":[145],"RTED":[146,162],"shown":[148],"among":[150],"all":[151],"algorithms":[152,169],"use":[154],"LRH":[155],"(":[156],"left-right-heavy":[157],")":[158],"strategies,":[159],"include":[161],"fastest":[165],"presented":[170],"literature.":[172],"experiments":[175],"synthetic":[177],"real-world":[179],"data":[180],"empirically":[182],"evaluate":[183],"solution":[185],"compare":[187],"it":[188],"state-of-the-art.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-14T08:43:22.919905","created_date":"2025-10-10T00:00:00"}