{"id":"https://openalex.org/W4246354033","doi":"https://doi.org/10.1137/1.9781611973105.130","title":"Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree","display_name":"Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree","publication_year":2013,"publication_date":"2013-01-06","ids":{"openalex":"https://openalex.org/W4246354033","doi":"https://doi.org/10.1137/1.9781611973105.130"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973105.130","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105.130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-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/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021765002","display_name":"Rolf Fagerberg","orcid":"https://orcid.org/0000-0003-1004-3314"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rolf Fagerberg","raw_affiliation_strings":["Department of Mathematics and Computer Science, Univer-sity of Southern Denmark, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Univer-sity of Southern Denmark, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071092440","display_name":"Thomas Mailund","orcid":"https://orcid.org/0000-0001-6206-9239"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Thomas Mailund","raw_affiliation_strings":["Bioinformatics Research Center, Aarhus University, Den-"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Center, Aarhus University, Den-","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113716245","display_name":"Christian N. S. Pedersen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian N. S. Pedersen","raw_affiliation_strings":["Bioinformatics Research Center, Aarhus University, Den-","Department of Computer Science, Aarhus University, Den-"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Center, Aarhus University, Den-","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Den-","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080191406","display_name":"Andreas Sand","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Andreas Sand","raw_affiliation_strings":["Bioinformatics Research Center, Aarhus University, Den-","Department of Computer Science, Aarhus University, Den-"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Center, Aarhus University, Den-","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Den-","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5039943336"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4908,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91245291,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1814","last_page":"1832"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9896000027656555,"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.9896000027656555,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.986299991607666,"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/T11106","display_name":"Data Management and Algorithms","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/degree","display_name":"Degree (music)","score":0.845726490020752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6155754327774048},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47237923741340637},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32685133814811707},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10883927345275879}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.845726490020752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6155754327774048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47237923741340637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32685133814811707},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10883927345275879},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611973105.130","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105.130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1996437477","https://openalex.org/W2009222636","https://openalex.org/W2060425093","https://openalex.org/W2144144677","https://openalex.org/W2160517437","https://openalex.org/W2171949301","https://openalex.org/W4239701164","https://openalex.org/W4379662611"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2399035783","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W3161230432","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278"],"abstract_inverted_index":{"The":[0,17,31,140],"triplet":[1,79,122,147,150],"and":[2,12,43,48,86,123,148,173],"quartet":[3,88,124,164,186],"distances":[4,32,151],"are":[5,33,60],"distance":[6,80,89,165],"measures":[7],"to":[8,76,118,131],"compare":[9],"two":[10,13,21,57,106],"rooted":[11],"unrooted":[14],"trees,":[15],"respectively.":[16],"leaves":[18],"of":[19,28,39,101],"the":[20,25,52,56,78,87,98,105,109,120,146,157,163,179,184],"trees":[22,59],"should":[23],"have":[24,152],"same":[26,110],"set":[27],"n":[29],"labels.":[30],"defined":[34],"by":[35],"enumerating":[36],"all":[37,196],"subsets":[38],"three":[40],"labels":[41,45],"(triplets)":[42],"four":[44],"(quartets),":[46],"respectively,":[47],"counting":[49],"how":[50,75],"often":[51],"induced":[53],"topologies":[54,135],"in":[55,81,90,104],"input":[58],"different.":[61],"In":[62],"this":[63],"paper":[64],"we":[65],"present":[66],"efficient":[67],"algorithms":[68,160,193],"for":[69,144,161],"computing":[70,145,162],"these":[71,197],"distances.":[72],"We":[73],"show":[74],"compute":[77,119,183],"time":[82,91,111,171,176],"O(n":[83],"log":[84,93,169],"n)":[85,170],"O(dn":[92],"n),":[94],"where":[95,126,178],"d":[96,189],"is":[97,129],"maximal":[99],"degree":[100],"any":[102],"node":[103],"trees.":[107],"Within":[108],"bounds,":[112],"our":[113,192],"framework":[114],"also":[115,182],"allows":[116],"us":[117],"parameterized":[121,149,185],"distances,":[125],"a":[127],"parameter":[128],"introduced":[130],"weight":[132],"resolved":[133],"(binary)":[134],"against":[136],"unresolved":[137],"(non-binary)":[138],"topologies.":[139],"previous":[141,158],"best":[142,159],"algorithm":[143,172],"O(n2)":[153],"running":[154],"time,":[155],"while":[156],"include":[166],"an":[167,174],"O(d9n":[168],"O(n2.688)":[175],"algorithm,":[177],"latter":[180],"can":[181],"distance.":[187],"Since":[188],"\u2264":[190],"n,":[191],"improve":[194],"on":[195],"algorithms.":[198]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}