The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Rapid Neighbour-Joining
Open accessAbstract
The neighbour-joining method reconstructs phylogenies by iteratively joining pairs of nodes until a single node remains. The criterion for which pair of nodes to merge is based on both the distance between the pair and the average distance to the rest of the nodes. In this paper, we present a new search strategy for the optimisation criteria used for selecting the next pair to merge and we show empirically that the new search strategy is superior to other state-of-the-art neighbour-joining implementations. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Sanderson, M. J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/19.2.301 · Cited by 1,906
Cited by
FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix
Price, M. N., Dehal, P. S., & Arkin, A. P. (2009) · Molecular Biology and Evolution · doi:10.1093/molbev/msp077 · Cited by 5,602
DALI and the persistence of protein shape
Holm, L. (2020) · Protein Science · doi:10.1002/pro.3749 · Cited by 692
ARIBA: rapid antimicrobial resistance genotyping directly from sequencing reads
Hunt, M., Mather, A. E., Sánchez-Busó, L., Page, A. J., Parkhill, J., Keane, J. A., & Harris, S. R. (2017) · Microbial Genomics · doi:10.1099/mgen.0.000131 · Cited by 660
PIRATE: A fast and scalable pangenomics toolbox for clustering diverged orthologues in bacteria
Bayliss, S. C., Thorpe, H. A., Coyle, N. M., Sheppard, S. K., & Feil, E. J. (2019) · GigaScience · doi:10.1093/gigascience/giz119 · Cited by 256
Patterns of coding variation in the complete exomes of three Neandertals
Castellano, S., Parra, G., Sánchez-Quinto, F. A., Racimo, F., Kuhlwilm, M., Kircher, M., Sawyer, S., Fu, Q., Heinze, A., Nickel, B., et al. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1405138111 · Cited by 247
Metadata
- Authors
- Simonsen, M., Mailund, T., & Pedersen, C. N. S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Pages
- 113-122
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2129816388
- Cited by
- 177
- References
- 1
- FWCI
- 14.86
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rapid Neighbour-Joining. https://app.cochat.ai/papers/10.1007/978-3-540-87361-7_10
- The paper
- Simonsen, M., Mailund, T., & Pedersen, C. N. S. (2008). Rapid Neighbour-Joining. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-87361-7_10
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.