The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Tolerating some redundancy significantly speeds up clustering of large protein databases
Open accessAbstract
Motivation: Sequence clustering replaces groups of similar sequences in a database with single representatives. Clustering large protein databases like the NCBI Non-Redundant database (NR) using even the best currently available clustering algorithms is very time-consuming and only practical at relatively high sequence identity thresholds. Our previous program, CD-HI, clustered NR at 90% identity in ∼1 h and at 75% identity in ∼1 day on a 1 GHz Linux PC (Li et al. , Bioinformatics, 17, 282, 2001); however even faster clustering speed is needed because the size of protein databases are rapidly growing and many applications desire a lower attainable thresholds. Results: For our previous algorithm (CD-HI), we have employed short-word filters to speed up the clustering. In this paper, we show that tolerating some redundancy makes for more efficient use of these short-word filters and increases the program’s speed 100 times. Our new program implements this technique and clusters NR at 70% identity within 2 h, and at 50% identity in ∼5 days. Although some redundancy is present after clustering, our new program’s results only differ from our previous program’s by less than 0.4%. Availability: The program and its previous version are available at http://bioinformatics.burnham-inst.org/cd-hi Contact: liwz@burnham-inst.org; adam@burnham-inst.org * To whom correspondence should be addressed.
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
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
The Pfam Protein Families Database
Bateman, A. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.276 · Cited by 14,000
Clustering of highly homologous sequences to reduce the size of large protein databases
Li, W., Jaroszewski, L., & Godzik, A. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.3.282 · Cited by 1,034
Self-citationSelection of representative protein data sets
Hobohm, U., Scharf, M., Schneider, R., & Sander, C. (1992) · Protein Science · doi:10.1002/pro.5560010313 · Cited by 819
Removing near-neighbour redundancy from large protein sequence collections.
Holm, L., & Sander, C. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.5.423 · Cited by 294
RSDB: representative protein sequence databases have high information content
Bhak, J., Holm, L., Heger, A., & Chothia, C. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.5.458 · Cited by 40
Cited by
Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences
Li, W., & Godzik, A. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl158 · Cited by 11,410
Self-citationFastTree: 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
The Universal Protein Resource (UniProt)
Bairoch, A. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki070 · Cited by 3,774
CD-HIT Suite: a web server for clustering and comparing biological sequences
Huang, Y., Niu, B., Gao, Y., Fu, L., & Li, W. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq003 · Cited by 2,607
Self-citationOne thousand plant transcriptomes and the phylogenomics of green plants
Initiative, O. T. P. T. (2019) · Nature · doi:10.1038/s41586-019-1693-2 · Cited by 1,734
Metadata
- Authors
- Li, W., Jaroszewski, L., & Godzik, A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-01-01
- Volume
- 18
- Issue
- 1
- Pages
- 77-82
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2135083016
- Cited by
- 516
- References
- 7
- FWCI
- 2.59
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Tolerating some redundancy significantly speeds up clustering of large protein databases. https://app.cochat.ai/papers/10.1093/bioinformatics/18.1.77
- The paper
- Li, W., Jaroszewski, L., & Godzik, A. (2002). Tolerating some redundancy significantly speeds up clustering of large protein databases. Bioinformatics. https://doi.org/10.1093/bioinformatics/18.1.77
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.