Cited by 1,928Genomics and Phylogenetic StudiesBioinformatics and Genomic NetworksMachine Learning in Bioinformatics

UniRef clusters: a comprehensive and scalable alternative for improving sequence similarity searches

Open access
Suzek, Baris E., Wang, Yuqi, Huang, Hongzhan, McGarvey, Peter B., Wu, Cathy H., the UniProt Consortium·2015·Bioinformatics

Abstract

Abstract Motivation: UniRef databases provide full-scale clustering of UniProtKB sequences and are utilized for a broad range of applications, particularly similarity-based functional annotation. Non-redundancy and intra-cluster homogeneity in UniRef were recently improved by adding a sequence length overlap threshold. Our hypothesis is that these improvements would enhance the speed and sensitivity of similarity searches and improve the consistency of annotation within clusters. Results: Intra-cluster molecular function consistency was examined by analysis of Gene Ontology terms. Results show that UniRef clusters bring together proteins of identical molecular function in more than 97% of the clusters, implying that clusters are useful for annotation and can also be used to detect annotation inconsistencies. To examine coverage in similarity results, BLASTP searches against UniRef50 followed by expansion of the hit lists with cluster members demonstrated advantages compared with searches against UniProtKB sequences; the searches are concise (∼7 times shorter hit list before expansion), faster (∼6 times) and more sensitive in detection of remote similarities (>96% recall at e-value <0.0001). Our results support the use of UniRef clusters as a comprehensive and scalable alternative to native sequence databases for similarity searches and reinforces its reliability for use in functional annotation. Availability and implementation: Web access and file download from UniProt website at http://www.uniprot.org/uniref and ftp://ftp.uniprot.org/pub/databases/uniprot/uniref. BLAST searches against UniRef are available at http://www.uniprot.org/blast/ Contact: huang@dbi.udel.edu

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btu739

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. Punta M.. (2012) The Pfam protein families database. Nucleic Acids Res., 40(Database issue), D290– D301. 22127870 PMC3245129

Cited by

Sorted by citations

Authors
Suzek, B. E., Wang, Y., Huang, H., McGarvey, P. B., Wu, C. H., & the UniProt Consortium
Affiliations
  • 1 Protein Information Resource, Georgetown University Medical Center, Washington, DC 20007, USA, 2Department of Computer Engineering, Muğla Sıtkı Koçman University, Muğla 48000, Turkey, 3Center for Bioinformatics and Computational Biology and Protein Information Resource, University of Delaware, Newark, DE 19711, USA, 4European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK and 5Swiss Institute of Bioinformatics, Centre Medical Universitaire, 1 rue Michel Servet, 1211 Geneva 4, Switzerland
  • European Bioinformatics Institute (GB)
Corresponding author
Huang, Hongzhan
Venue
Bioinformatics
Published
2014-11-13
Volume
31
Issue
6
Pages
926-932
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2102461176
Cited by
1,928
References
30
Citations by year
2026: 193 · 2025: 298 · 2024: 306 · 2023: 252 · 2022: 225 · 2021: 226 · 2020: 130 · 2019: 95 · 2018: 84 · 2017: 69 · 2016: 36 · 2015: 12 · 2012: 1
FWCI
16.12
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • reroDoc Digital Library (submittedVersion)
  • Muğla Sıtkı Koçman University Institutional Repository (submittedVersion, other-oa)
Funders
  • National Institutes of Health
  • National Human Genome Research Institute (U41HG006104, U41HG007822)
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
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
Keywords
protein sequence clustering, sequence similarity search, functional annotation, Gene Ontology, BLASTP, remote homology detection, UniProtKB
MeSH terms
AlkB Homolog 5, RNA Demethylase, Humans, Membrane Proteins, Proteins, Software, Cluster Analysis, Information Storage and Retrieval, Computational Biology, Sequence Analysis, Protein, Databases, Protein, Dioxygenases, Molecular Sequence Annotation, Gene Ontology

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