The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
UniRef: comprehensive and non-redundant UniProt reference clusters
Open accessAbstract
MOTIVATION: Redundant protein sequences in biological databases hinder sequence similarity searches and make interpretation of search results difficult. Clustering of protein sequence space based on sequence similarity helps organize all sequences into manageable datasets and reduces sampling bias and overrepresentation of sequences. RESULTS: The UniRef (UniProt Reference Clusters) provide clustered sets of sequences from the UniProt Knowledgebase (UniProtKB) and selected UniProt Archive records to obtain complete coverage of sequence space at several resolutions while hiding redundant sequences. Currently covering >4 million source sequences, the UniRef100 database combines identical sequences and subfragments from any source organism into a single UniRef entry. UniRef90 and UniRef50 are built by clustering UniRef100 sequences at the 90 or 50% sequence identity levels. UniRef100, UniRef90 and UniRef50 yield a database size reduction of approximately 10, 40 and 70%, respectively, from the source sequence set. The reduced redundancy increases the speed of similarity searches and improves detection of distant relationships. UniRef entries contain summary cluster and membership information, including the sequence of a representative protein, member count and common taxonomy of the cluster, the accession numbers of all the merged entries and links to rich functional annotation in UniProtKB to facilitate biological discovery. UniRef has already been applied to broad research areas ranging from genome annotation to proteomics data analysis. AVAILABILITY: UniRef is updated biweekly and is available for online search and retrieval at http://www.uniprot.org, as well as for download at ftp://ftp.uniprot.org/pub/databases/uniprot/uniref. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The second set contains 1964 unique mammalian protein complexes filtered against the IntAct43 dataset from Negatome31.”
From Improved prediction of protein-protein interactions using AlphaFold2 (2021) · cites this paper as [43]
Experimental — accuracy not yet measured
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
Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences
Li, W.-Z., & Godzik, A. (2006) · Bioinform. · doi:10.1093/bioinformatics/btl158 · Cited by 10,996
Database resources of the National Center for Biotechnology Information: update
Wheeler, D. L. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkh073 · Cited by 10,695
Pruitt, K. D., Tatusova, T. A., & Maglott, D. R. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl842 · Cited by 4,441
The Universal Protein Resource (UniProt)
Bairoch, A. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki070 · Cited by 3,774
The Universal Protein Resource (UniProt): an expanding universe of protein information
Wu, C. H. (2005) · Nucleic Acids Research · doi:10.1093/nar/gkj161 · Cited by 1,116
Self-citationClustering of highly homologous sequences to reduce the size of large protein databases
Li, W.-Z., Jaroszewski, L., & Godzik, A. (2001) · Bioinform. · doi:10.1093/bioinformatics/17.3.282 · Cited by 1,021
Length-dependent prediction of protein intrinsic disorder
Peng, K., Predrag Radivojac, A., Vučetić, S., Dunker, A. K., & Zoran Obradovic, A. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-208 · Cited by 940
Selection of representative protein data sets
Hobohm, U., Scharf, M. E., Schneider, R., & Sander, C. (1992) · Protein Science · doi:10.1002/pro.5560010313 · Cited by 816
Database resources of the National Center for Biotechnology Information
Wheeler, D. L., Barrett, T., Benson, D. A., Bryant, S. H., Canese, K., Chetvernin, V., Church, D. M., DiCuccio, M., Edgar, R., Federhen, S., et al. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkl1031 · Cited by 734
Identification of multiple distinct Snf2 subfamilies with conserved structural motifs
Flaus, A. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl295 · Cited by 727
Flagged first, then by citations
Cited by
Sorted by citations
Items 1,001–1,002 of 1,002
Multimodal graph, surface, and language-based model for protein protein interaction prediction
Arteaga, D., Chervov, N., & Poptsova, M. (2026) · Scientific Reports · doi:10.1038/s41598-025-34758-x · Cited by 3
Arnoux, J. (2026) · Thèse de doctorat, Université Paris-Saclay / PPanGGOLiN · doi:10.70675/eee354d9zf63dz48ebz9444zd1809f8fb74d
Metadata
- Authors
- Suzek, B. E., Huang, H., McGarvey, P., Mazumder, R., & Wu, C. H.
- Affiliations
- Protein Information Resource, Department of Biochemistry and Molecular & Cellular Biology, Georgetown University Medical Center, Washington, DC 20007, USA
- Georgetown University Medical Center (US)
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-03-22
- Volume
- 23
- Issue
- 10
- Pages
- 1282-1288
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2076048958
- Cited by
- 1,613
- References
- 51
- Citations by year
- 2026: 137 · 2025: 197 · 2024: 164 · 2023: 132 · 2022: 93 · 2021: 84 · 2020: 68 · 2019: 69 · 2018: 55 · 2017: 74 · 2016: 87 · 2015: 91 · 2014: 64 · 2013: 82 · 2012: 63
- FWCI
- 13.26
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by-nc
- Locations
- Bioinformatics (publishedVersion, cc-by-nc)
- PubMed (publishedVersion)
- Funders
- European Bioinformatics Institute
- National Institutes of Health
- National Human Genome Research Institute (U01HG02712, U01HG002712)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
- Physical Sciences › Chemistry › Spectroscopy › Advanced Proteomics Techniques and Applications
- Keywords
- protein sequence clustering, sequence similarity search, protein sequence space, distant homology detection, functional annotation
- MeSH terms
- Amino Acid Sequence, Animals, Humans, Proteins, Information Storage and Retrieval, Computational Biology, Databases, Protein
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