{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T12:53:25Z","timestamp":1767876805205,"version":"3.49.0"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"17","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004,11,22]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: We have built a tool for fast construction of very large phylogenetic trees. The tool uses heuristics for speeding up the neighbour-joining algorithm\u2014while still constructing the same tree as the original neighbour-joining algorithm\u2014making it possible to construct trees for 8000 species in &amp;lt;10 min on a single desktop PC. In comparison, the same task takes more than 30 min using the QuickTree neighbour-joining implementation.<\/jats:p>\n               <jats:p>Availability: The source code for QuickJoin is available from http:\/\/www.birc.dk\/Software\/QuickJoin under the GNU Public License (GPL).<\/jats:p>","DOI":"10.1093\/bioinformatics\/bth359","type":"journal-article","created":{"date-parts":[[2004,6,17]],"date-time":"2004-06-17T00:34:02Z","timestamp":1087432442000},"page":"3261-3262","source":"Crossref","is-referenced-by-count":31,"title":["QuickJoin\u2014fast neighbour-joining tree reconstruction"],"prefix":"10.1093","volume":"20","author":[{"given":"Thomas","family":"Mailund","sequence":"first","affiliation":[{"name":"Bioinformatics Research Center (BiRC), University of Aarhus, H\u00f8egh-Guldbergs Grade 10, Bldg. 090, DK-8000 \u00c5rhus C, Denmark"}]},{"given":"Christian N. S.","family":"Pedersen","sequence":"additional","affiliation":[{"name":"Bioinformatics Research Center (BiRC), University of Aarhus, H\u00f8egh-Guldbergs Grade 10, Bldg. 090, DK-8000 \u00c5rhus C, Denmark"}]}],"member":"286","published-online":{"date-parts":[[2004,6,16]]},"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/20\/17\/3261\/48906447\/bioinformatics_20_17_3261.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/20\/17\/3261\/48906447\/bioinformatics_20_17_3261.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T16:16:00Z","timestamp":1674663360000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/20\/17\/3261\/186367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,16]]},"references-count":0,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2004,11,22]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bth359","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2004,11,22]]},"published":{"date-parts":[[2004,6,16]]}}}