The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
QuickTree: building huge Neighbour-Joining trees of protein sequences
Abstract
Summary: We have written a fast implementation of the popular Neighbor-Joining tree building algorithm. QuickTree allows the reconstruction of phylogenies for very large protein families (including the largest Pfam alignment containing 27000 HIV GP120 glycoprotein sequences) that would be infeasible using other popular methods. Availability: The source-code for QuickTree, written in ANSI~C, is freely available via the world wide web at http://www.sanger.ac.uk/Software/analysis/quicktree Contact: klh@sanger.ac.uk * To whom correspondence should be addressed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4673 · Cited by 64,617
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
(1987) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040454 · Cited by 59,715
The Pfam Protein Families Database
Bateman, A. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.276 · Cited by 14,000
Self-citationEMBOSS: the European molecular biology open software suite.
Rice, P., Longden, I., & Bleasby, A. (2000) · Trends in Genetics · doi:10.1016/s0168-9525(00)02024-2 · Cited by 9,466
A Statistical Method for Evaluating Systematic Relationships
Sokal, R. R., & Michener, C. D. (1958) · Biodiversity Heritage Library (Smithsonian Institution) · doi:10.5281/zenodo.16435756 · Cited by 4,416
The SWISS-PROT protein sequence data bank and its supplement TrEMBL
Bairoch, A., & Apweiler, R. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.1.31 · Cited by 3,587
Biological sequence analysis probabilistic models of proteins and nucleic acids
Durbin, R. M., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cited by 3,565
Self-citationThe SWISS-PROT protein sequence data bank and its supplement TrEMBL in 1998
Bairoch, A. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.1.38 · Cited by 3,280
BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data
Gascuel, O. (1997) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025808 · Cited by 1,836
(2019) · Communications in Computer and Information Science · doi:10.1007/978-3-030-16205-4 · Cited by 497
A note on the neighbor-joining algorithm of Saitou and Nei.
(1988) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040527 · Cited by 445
Cited by
The Pfam Protein Families Database
Bateman, A. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.276 · Cited by 14,000
Self-citationbold : The Barcode of Life Data System (http://www.barcodinglife.org)
RATNASINGHAM, S., & HEBERT, P. D. N. (2007) · Molecular Ecology Notes · doi:10.1111/j.1471-8286.2007.01678.x · Cited by 6,376
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
Multiple sequence alignment with the Clustal series of programs
Chenna, R. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg500 · Cited by 4,875
Microbial diversity in the deep sea and the underexplored “rare biosphere”
Sogin, M. L., Morrison, H. G., Huber, J. A., Welch, D. M., Huse, S. M., Neal, P. R., Arrieta, J. M., & Herndl, G. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605127103 · Cited by 3,701
Metadata
- Authors
- Howe, K., Bateman, A., & Durbin, R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-11-01
- Volume
- 18
- Issue
- 11
- Pages
- 1546-1547
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2118488195
- Cited by
- 300
- References
- 11
- FWCI
- 2.27
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.