{"id":"https://openalex.org/W2164147196","doi":"https://doi.org/10.1186/1471-2105-14-s2-s18","title":"A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees","display_name":"A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2164147196","doi":"https://doi.org/10.1186/1471-2105-14-s2-s18","mag":"2164147196","pmid":"https://pubmed.ncbi.nlm.nih.gov/23368759"},"language":"en","primary_location":{"id":"doi:10.1186/1471-2105-14-s2-s18","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1471-2105-14-s2-s18","pdf_url":"https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-14-S2-S18","source":{"id":"https://openalex.org/S19032547","display_name":"BMC Bioinformatics","issn_l":"1471-2105","issn":["1471-2105"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BMC Bioinformatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-14-S2-S18","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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, Denmark","Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Center, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"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"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Denmark","MADALGO, Center for Massive Data Algorithms, a Center of the Danish National Research Foundation, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"MADALGO, Center for Massive Data Algorithms, a Center of the Danish National Research Foundation, Denmark","institution_ids":["https://openalex.org/I4210095128"]}]},{"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, University of Southern Denmark, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103578511","display_name":"Christian NS 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"]},{"id":"https://openalex.org/I4210087405","display_name":"Danish National Research Foundation","ror":"https://ror.org/00znyv691","country_code":"DK","type":"nonprofit","lineage":["https://openalex.org/I4210087405"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian NS Pedersen","raw_affiliation_strings":["Bioinformatics Research Center, Aarhus University, Denmark","Department of Computer Science, Aarhus University, Denmark","PUMPKIN, Center for Membrane Pumps in Cells and Disease, a Center of the Danish National Research Foundation, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Center, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"PUMPKIN, Center for Membrane Pumps in Cells and Disease, a Center of the Danish National Research Foundation, Denmark","institution_ids":["https://openalex.org/I4210087405"]}]},{"author_position":"last","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":true,"raw_author_name":"Thomas Mailund","raw_affiliation_strings":["Bioinformatics Research Center, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Center, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071092440"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2790,"currency":"USD","value_usd":2790},"apc_paid":{"value":2790,"currency":"USD","value_usd":2790},"fwci":2.2365,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.90394786,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"S2","first_page":"S18","last_page":"S18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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.9980000257492065,"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.9980000257492065,"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/binary-tree","display_name":"Binary tree","score":0.6647371649742126},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6558856964111328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6102321147918701},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.566066563129425},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5592839121818542},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5559614896774292},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.542671799659729},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5255916118621826},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5086015462875366},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5035805106163025},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5003516674041748},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4827367663383484},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41585463285446167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3755112290382385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34395933151245117},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10227170586585999},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09965664148330688}],"concepts":[{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6647371649742126},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6558856964111328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6102321147918701},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.566066563129425},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5592839121818542},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5559614896774292},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.542671799659729},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5255916118621826},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5086015462875366},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5035805106163025},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5003516674041748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4827367663383484},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41585463285446167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3755112290382385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34395933151245117},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10227170586585999},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09965664148330688},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D010802","descriptor_name":"Phylogeny","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D010802","descriptor_name":"Phylogeny","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D010802","descriptor_name":"Phylogeny","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false}],"locations_count":6,"locations":[{"id":"doi:10.1186/1471-2105-14-s2-s18","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1471-2105-14-s2-s18","pdf_url":"https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-14-S2-S18","source":{"id":"https://openalex.org/S19032547","display_name":"BMC Bioinformatics","issn_l":"1471-2105","issn":["1471-2105"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BMC Bioinformatics","raw_type":"journal-article"},{"id":"pmid:23368759","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/23368759","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BMC bioinformatics","raw_type":null},{"id":"pmh:oai:pure.atira.dk:publications/67eb1954-eaf4-475d-b5e8-13f2bafdeb75","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/67eb1954-eaf4-475d-b5e8-13f2bafdeb75","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sand, A, Pedersen, C N S, Mailund, T, Brodal, G S & Fagerberg, R 2013, 'A practical O( n log 2 n ) time algorithm for computing the triplet distance on binary trees', BMC Bioinformatics, vol. 14, no. Suppl 2, pp. S18. https://doi.org/10.1186/1471-2105-14-S2-S18","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:sdu.dk:openaire/352543bb-ecaf-417f-9386-da1504357060","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/352543bb-ecaf-417f-9386-da1504357060","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"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":"Sand, A, Brodal, G S, Fagerberg, R, Pedersen, C N S & Mailund, T 2013, 'A practical O ( n log 2 n ) time algorithm for computing the triplet distance on binary trees', BMC Bioinformatics, vol. 14, no. Suppl. 2, S18. https://doi.org/10.1186/1471-2105-14-S2-S18","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:europepmc.org:2552333","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/3549851","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:sdu.dk:Publications/352543bb-ecaf-417f-9386-da1504357060","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1186/1471-2105-14-s2-s18","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1471-2105-14-s2-s18","pdf_url":"https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-14-S2-S18","source":{"id":"https://openalex.org/S19032547","display_name":"BMC Bioinformatics","issn_l":"1471-2105","issn":["1471-2105"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BMC Bioinformatics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2164147196.pdf","grobid_xml":"https://content.openalex.org/works/W2164147196.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1977694535","https://openalex.org/W1978384785","https://openalex.org/W1996437477","https://openalex.org/W1999727705","https://openalex.org/W2009222636","https://openalex.org/W2060425093","https://openalex.org/W2062253327","https://openalex.org/W2127063840","https://openalex.org/W2137614260","https://openalex.org/W2144144677","https://openalex.org/W2146245219","https://openalex.org/W2160517437","https://openalex.org/W2171949301","https://openalex.org/W2912606590","https://openalex.org/W4254848882","https://openalex.org/W4379662611"],"related_works":["https://openalex.org/W4399803855","https://openalex.org/W2056975861","https://openalex.org/W2363556447","https://openalex.org/W4377371889","https://openalex.org/W2089900921","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2010914215","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"The":[0,59],"triplet":[1,46,113],"distance":[2,5,47,70,85,114],"is":[3,61],"a":[4,88,121],"measure":[6],"that":[7,43,97,111],"compares":[8],"two":[9,49,72],"rooted":[10,50],"trees":[11,52,75],"on":[12],"the":[13,29,33,45,68,83,93,112],"same":[14],"set":[15],"of":[16,22,32],"leaves":[17,24],"by":[18],"enumerating":[19],"all":[20],"sub-sets":[21],"three":[23],"and":[25],"counting":[26],"how":[27],"often":[28],"induced":[30],"topologies":[31],"tree":[34],"are":[35],"equal":[36],"or":[37],"different.":[38],"We":[39],"present":[40],"an":[41,64],"algorithm":[42,60,65,86,115],"computes":[44],"between":[48,71],"binary":[51,74],"in":[53,76,92],"time":[54,77,95,105],"O":[55,78,103],"(n":[56,79],"log2":[57],"n).":[58,81],"related":[62],"to":[63,102,119],"for":[66],"computing":[67],"quartet":[69,84],"unrooted":[73],"log":[80],"While":[82],"has":[87],"very":[89],"severe":[90],"overhead":[91],"asymptotic":[94],"complexity":[96],"makes":[98],"it":[99],"impractical":[100],"compared":[101],"(n2)":[104],"algorithms,":[106],"we":[107],"show":[108],"through":[109],"experiments":[110],"can":[116],"be":[117],"implemented":[118],"give":[120],"competitive":[122],"wall-time":[123],"running":[124],"time.":[125]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}