{"id":"https://openalex.org/W2005450316","doi":"https://doi.org/10.1142/s0218001488000157","title":"THE TREE-TO-TREE EDITING PROBLEM","display_name":"THE TREE-TO-TREE EDITING PROBLEM","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W2005450316","doi":"https://doi.org/10.1142/s0218001488000157","mag":"2005450316"},"language":"en","primary_location":{"id":"doi:10.1142/s0218001488000157","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001488000157","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","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/A5017958083","display_name":"Eiichi Tanaka","orcid":"https://orcid.org/0000-0003-2850-326X"},"institutions":[{"id":"https://openalex.org/I207399273","display_name":"Utsunomiya University","ror":"https://ror.org/05bx1gz93","country_code":"JP","type":"education","lineage":["https://openalex.org/I207399273"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"EIICHI TANAKA","raw_affiliation_strings":["Department of Information Science, Utsunomiya University 2753 Ishiimachi, Utsunomiya 321, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Science, Utsunomiya University 2753 Ishiimachi, Utsunomiya 321, Japan","institution_ids":["https://openalex.org/I207399273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062644237","display_name":"KEIKO TANAKA","orcid":null},"institutions":[{"id":"https://openalex.org/I207399273","display_name":"Utsunomiya University","ror":"https://ror.org/05bx1gz93","country_code":"JP","type":"education","lineage":["https://openalex.org/I207399273"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"KEIKO TANAKA","raw_affiliation_strings":["Department of Information Science, Utsunomiya University 2753 Ishiimachi, Utsunomiya 321, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Science, Utsunomiya University 2753 Ishiimachi, Utsunomiya 321, Japan","institution_ids":["https://openalex.org/I207399273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I207399273"],"apc_list":null,"apc_paid":null,"fwci":0.5823,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.74318602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"02","issue":"02","first_page":"221","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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":0.9980999827384949,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9962999820709229,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7645367383956909},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.6970056295394897},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6908457279205322},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6520787477493286},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.5606475472450256},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.552276074886322},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5386787056922913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5321444869041443},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.5017476081848145},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.48715779185295105},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4830347001552582},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3936968445777893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38393858075141907},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3512202203273773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19278723001480103},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.18830794095993042},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.08373811841011047}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7645367383956909},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.6970056295394897},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6908457279205322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6520787477493286},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.5606475472450256},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.552276074886322},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5386787056922913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5321444869041443},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.5017476081848145},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.48715779185295105},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4830347001552582},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3936968445777893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38393858075141907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3512202203273773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19278723001480103},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.18830794095993042},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.08373811841011047}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218001488000157","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001488000157","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","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":0,"referenced_works":[],"related_works":["https://openalex.org/W4244673516","https://openalex.org/W22108090","https://openalex.org/W1999216101","https://openalex.org/W2107381954","https://openalex.org/W2592730620","https://openalex.org/W2084831204","https://openalex.org/W2125650843","https://openalex.org/W2005450316","https://openalex.org/W2160466620","https://openalex.org/W2150475707"],"abstract_inverted_index":{"This":[0,162],"paper":[1],"describes":[2],"the":[3,7,12,21,25,43,75,120,131,149],"computing":[4],"alogrithms":[5],"for":[6],"tree":[8,33,37,56,64,163,175,180],"distance":[9,17,76,164],"based":[10],"on":[11],"structure":[13,44,187],"preserving":[14,45,188],"mapping.":[15,46,189],"The":[16,47,143],"is":[18,146],"defined":[19],"as":[20],"minimum":[22],"sum":[23],"of":[24,27,42,54,62,122,124,135],"weights":[26],"edit":[28,48],"operations":[29,49],"needed":[30],"to":[31,36,57,69,148,168],"transform":[32],"T":[34,38,80,125,128,136,139],"\u03b1":[35,85,89,93,103,109,115,126,137,154],"\u03b2":[39,81,87,95,97,105,112,118,129,140,156],"under":[40],"restriction":[41],"allow":[50],"substituting":[51],"a":[52,55,60,63,67,70],"vertex":[53,61,68],"another,":[58],"deleting":[59],"and":[65,79,99,116,138,177,179],"inserting":[66],"tree.":[71],"Proposed":[72],"algorithms":[73,159],"determine":[74],"between":[77],"T\u03b1":[78],"in":[82,100,186],"time":[83,144],"O(N":[84,92,102,153],"N":[86,94,104,108,111,155],"L":[88,96,114,117],")":[90],"or":[91],"),":[98,106],"space":[101],"where":[107],",":[110,113,127,130,141],"are":[119,160,184],"number":[121,132],"vertices":[123],"of\u2019":[133],"leaves":[134],"respectively.":[142],"complexity":[145],"close":[147],"unapproachable":[150],"lowest":[151],"bound":[152],").":[157],"Improved":[158],"presented.":[161],"can":[165],"be":[166],"applied":[167],"any":[169],"problems":[170],"including":[171],"pattern":[172],"recognition,":[173],"syntactic":[174],"comparison":[176,181],"classification,":[178],"whose":[182],"structures":[183],"important":[185]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}