{"id":"https://openalex.org/W2009222636","doi":"https://doi.org/10.1186/1748-7188-6-15","title":"A sub-cubic time algorithm for computing the quartet distance between two general trees","display_name":"A sub-cubic time algorithm for computing the quartet distance between two general trees","publication_year":2011,"publication_date":"2011-06-03","ids":{"openalex":"https://openalex.org/W2009222636","doi":"https://doi.org/10.1186/1748-7188-6-15","mag":"2009222636","pmid":"https://pubmed.ncbi.nlm.nih.gov/21639882"},"language":"en","primary_location":{"id":"doi:10.1186/1748-7188-6-15","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-6-15","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-6-15","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"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":"Algorithms for Molecular Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-6-15","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085043937","display_name":"Jesper Kresten Nielsen","orcid":"https://orcid.org/0000-0001-7304-7262"},"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":"Jesper Nielsen","raw_affiliation_strings":["Bioinformatics Research Centre (BiRC), Aarhus University, C, F, M\u00f8llers Alle 8, DK-8000 Aarhus C, Denmark. jn@birc.au.dk","Bioinformatics Research Centre (BiRC), Aarhus University, C. F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Centre (BiRC), Aarhus University, C, F, M\u00f8llers Alle 8, DK-8000 Aarhus C, Denmark. jn@birc.au.dk","institution_ids":[]},{"raw_affiliation_string":"Bioinformatics Research Centre (BiRC), Aarhus University, C. F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013967580","display_name":"Anders K. Kristensen","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":"Anders K Kristensen","raw_affiliation_strings":["Department of Computer Science, Aarhus University, \u00c5bogade 34, DK-8200, Aarhus N, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, \u00c5bogade 34, DK-8200, Aarhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"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 Centre (BiRC), Aarhus University, C. F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Centre (BiRC), Aarhus University, C. F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","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"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian NS Pedersen","raw_affiliation_strings":["Bioinformatics Research Centre (BiRC), Aarhus University, C. F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark","Department of Computer Science, Aarhus University, \u00c5bogade 34, DK-8200, Aarhus N, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bioinformatics Research Centre (BiRC), Aarhus University, C. F. M\u00f8llers Alle 8, DK-8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Department of Computer Science, Aarhus University, \u00c5bogade 34, DK-8200, Aarhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5085043937"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":1.5962,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.82276669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"1","first_page":"15","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.8902999758720398,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.8902999758720398,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.05209999904036522,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12946","display_name":"Fractal and DNA sequence analysis","score":0.00930000003427267,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.622969925403595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5399899482727051},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.38565436005592346}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.622969925403595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5399899482727051},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.38565436005592346}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1186/1748-7188-6-15","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-6-15","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-6-15","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"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":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:21639882","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/21639882","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":"Algorithms for molecular biology : AMB","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire/670e799a-f43a-480e-9248-0bc55c58e2f7","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/670e799a-f43a-480e-9248-0bc55c58e2f7","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":"Nielsen, J, Kristensen, A K, Mailund, T & Pedersen, C N S 2011, 'A sub-cubic time algorithm for computing the quartet distance between two general trees', Algorithms for Molecular Biology, vol. 6, no. 15. https://doi.org/10.1186/1748-7188-6-15","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:5d590255e2634b178d44ef771989e0be","is_oa":false,"landing_page_url":"https://doaj.org/article/5d590255e2634b178d44ef771989e0be","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms for Molecular Biology, Vol 6, Iss 1, p 15 (2011)","raw_type":"article"},{"id":"pmh:oai:pubmedcentral.nih.gov:3141660","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/3141660","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms Mol Biol","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1186/1748-7188-6-15","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-6-15","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-6-15","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"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":"Algorithms for Molecular Biology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2009222636.pdf","grobid_xml":"https://content.openalex.org/works/W2009222636.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1843274134","https://openalex.org/W1977694535","https://openalex.org/W1978384785","https://openalex.org/W1979740015","https://openalex.org/W1998459277","https://openalex.org/W2044789562","https://openalex.org/W2060425093","https://openalex.org/W2063709694","https://openalex.org/W2127063840","https://openalex.org/W2160517437","https://openalex.org/W2171949301","https://openalex.org/W2186629762","https://openalex.org/W4254848882","https://openalex.org/W4285719527","https://openalex.org/W4379662611"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"BACKGROUND:":[0],"When":[1],"inferring":[2],"phylogenetic":[3],"trees":[4,22,62,113],"different":[5,9],"algorithms":[6],"may":[7],"give":[8],"trees.":[10,42],"To":[11],"study":[12],"such":[13,29],"effects":[14],"a":[15,47,56],"measure":[16],"for":[17,50,106],"the":[18,33,52,83,92,95,101,108,116,119,131,141],"distance":[19,26,54,110],"between":[20,40,55,111],"two":[21,41,129],"is":[23,27,32,80,137],"useful.":[24],"Quartet":[25],"one":[28],"measure,":[30],"and":[31,74,87,128,143],"number":[34,84],"of":[35,58,77,85,94,115,118,130],"quartet":[36,53,109],"topologies":[37],"that":[38],"differ":[39],"RESULTS:":[43],"We":[44,123],"have":[45,67,124],"derived":[46],"new":[48,135],"algorithm":[49,79,103,127,136],"computing":[51,107],"pair":[57],"general":[59,112],"trees,":[60],"i.e.":[61],"where":[63],"inner":[64,96,120],"nodes":[65],"can":[66],"any":[68],"degree":[69,93,117],"\u2265":[70],"3.":[71],"The":[72],"time":[73,151],"space":[75],"complexity":[76],"our":[78,126],"sub-cubic":[81],"in":[82,147,152],"leaves":[86],"does":[88],"not":[89],"depend":[90],"on":[91],"nodes.":[97,121],"This":[98],"makes":[99],"it":[100],"fastest":[102],"so":[104],"far":[105],"independent":[114],"CONCLUSIONS:":[122],"implemented":[125],"best":[132],"competitors.":[133],"Our":[134],"significantly":[138],"faster":[139],"than":[140],"competition":[142],"seems":[144],"to":[145,149],"run":[146],"close":[148],"quadratic":[150],"practice.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}