{"id":"https://openalex.org/W2162315852","doi":"https://doi.org/10.1142/s0129054106004054","title":"FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES","display_name":"FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES","publication_year":2006,"publication_date":"2006-06-01","ids":{"openalex":"https://openalex.org/W2162315852","doi":"https://doi.org/10.1142/s0129054106004054","mag":"2162315852"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054106004054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004054","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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/A5009391489","display_name":"Daiji Fukagawa","orcid":null},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"DAIJI FUKAGAWA","raw_affiliation_strings":["Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto, 606\u20138501, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto, 606\u20138501, Japan","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016330265","display_name":"Tatsuya Akutsu","orcid":"https://orcid.org/0000-0001-9763-797X"},"institutions":[{"id":"https://openalex.org/I4399598384","display_name":"Kyoto University Institute for Chemical Research","ror":"https://ror.org/0349bbg69","country_code":null,"type":"facility","lineage":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]},{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"TATSUYA AKUTSU","raw_affiliation_strings":["Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611\u20130011, Japan"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611\u20130011, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009391489"],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14071559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"17","issue":"03","first_page":"703","last_page":"729"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.994700014591217,"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.994700014591217,"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.9940999746322632,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9926999807357788,"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/bounded-function","display_name":"Bounded function","score":0.7898609042167664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6321515440940857},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6114535331726074},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5727629065513611},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5707797408103943},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5343403816223145},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5197789072990417},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48584768176078796},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4842793345451355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4786083400249481},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46982789039611816},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.4120485782623291},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3957292437553406},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.36966902017593384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22461354732513428},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.04928112030029297}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7898609042167664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6321515440940857},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6114535331726074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5727629065513611},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5707797408103943},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5343403816223145},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5197789072990417},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48584768176078796},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4842793345451355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4786083400249481},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46982789039611816},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.4120485782623291},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3957292437553406},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.36966902017593384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22461354732513428},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.04928112030029297},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054106004054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004054","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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":22,"referenced_works":["https://openalex.org/W108777047","https://openalex.org/W1488310749","https://openalex.org/W1559144499","https://openalex.org/W1655990431","https://openalex.org/W1718544036","https://openalex.org/W1975009259","https://openalex.org/W1975200441","https://openalex.org/W1976373002","https://openalex.org/W1984570480","https://openalex.org/W2011975945","https://openalex.org/W2031810922","https://openalex.org/W2035582095","https://openalex.org/W2040344654","https://openalex.org/W2052899946","https://openalex.org/W2054729486","https://openalex.org/W2056708848","https://openalex.org/W2090070826","https://openalex.org/W2103626206","https://openalex.org/W2116509046","https://openalex.org/W2128695242","https://openalex.org/W4212877087","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W270522628","https://openalex.org/W4376140277","https://openalex.org/W2091985989","https://openalex.org/W4367055576","https://openalex.org/W2077383771","https://openalex.org/W2011933350","https://openalex.org/W2914983903","https://openalex.org/W1971148082","https://openalex.org/W2019778981","https://openalex.org/W2146997899"],"abstract_inverted_index":{"We":[0,60,92],"present":[1,32],"fast":[2],"algorithms":[3],"for":[4,12,28,64,80,99,115,125],"computing":[5,13],"the":[6,14,25,42,50,96],"largest":[7],"common":[8],"subtree":[9],"(LCST)":[10],"and":[11,49,67,101],"optimal":[15],"alignment":[16,97],"when":[17],"two":[18,46,81],"similar":[19,82],"unordered":[20,102],"trees":[21,48,66,83,103],"are":[22,78],"given.":[23],"For":[24],"LCST":[26],"problem":[27,98],"rooted":[29,100],"trees,":[30],"we":[31],"an":[33,69],"O(4":[34],"K":[35,71,85,112],"n)":[36,72,90,113],"time":[37,73,114],"algorithm,":[38],"where":[39],"n":[40],"is":[41,56,121],"maximum":[43],"size":[44],"of":[45,53,76,104],"input":[47],"total":[51],"number":[52],"non-common":[54],"nodes":[55],"bounded":[57,105],"by":[58],"K.":[59],"extend":[61],"this":[62],"algorithm":[63],"unrooted":[65],"obtain":[68],"O(K4":[70],"algorithm.":[74],"Both":[75],"these":[77],"subquadratic":[79],"within":[84],"=":[86],"o(":[87],"log":[88],"4":[89],"differences.":[91],"also":[93],"show":[94],"that":[95],"degree":[106],"can":[107],"be":[108],"solved":[109],"in":[110],"O(\u03b3":[111],"a":[116],"constant":[117],"\u03b3.":[118],"Particularly":[119],"\u03b3":[120],"at":[122],"most":[123],"4.45":[124],"unlabeled":[126],"binary":[127],"trees.":[128]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}