Demo Data from EDBT 2026 / reviewers in the wild / expert
James Barbetti
dblp:370/4684
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
neighbor-joining |
0.7 | 1 | 2023 | DecentTree: scalable Neighbour-Joining for the genomic era · Bioinform. 2023 |
Bioinformatics and computational biology
phylogenetics |
0.7 | 1 | 2023 | DecentTree: scalable Neighbour-Joining for the genomic era · Bioinform. 2023 |
Bioinformatics and computational biology › phylogenetics
phylogenetic inference |
0.7 | 1 | 2023 | DecentTree: scalable Neighbour-Joining for the genomic era · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
parallel computing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | DecentTree: scalable Neighbour-Joining for the genomic eraabstractMOTIVATION: Neighbour-Joining is one of the most widely used distance-based phylogenetic inference methods. However, current implementations do not scale well for datasets with more than 10 000 sequences. Given the increasing pace of generating new sequence data, particularly in outbreaks of emerging diseases, and the already enormous existing databases of sequence data for which Neighbour-Joining is a useful approach, new implementations of existing methods are warranted. RESULTS: Here, we present DecentTree, which provides highly optimized and parallel implementations of Neighbour-Joining and several of its variants. DecentTree is designed as a stand-alone application and a header-only library easily integrated with other phylogenetic software (e.g. it is integral in the popular IQ-TREE software). We show that DecentTree shows similar or improved performance over existing software (BIONJ, Quicktree, FastME, and RapidNJ), especially for handling very large alignments. For example, DecentTree is up to 6-fold faster than the fastest existing Neighbour-Joining software (e.g. RapidNJ) when generating a tree of 64 000 SARS-CoV-2 genomes. AVAILABILITY AND IMPLEMENTATION: DecentTree is open source and freely available at https://github.com/iqtree/decenttree. All code and data used in this analysis are available on Github (https://github.com/asdcid/Comparison-of-neighbour-joining-software). James Barbetti, Bryan Thornlow, Russell Corbett-Detig, Yatish Turakhia, Robert Lanfear, Bui Quang Minh |
Bioinform. | 2 |