The DOI matches its Crossref record.
Removing near-neighbour redundancy from large protein sequence collections.
Open accessAbstract
MOTIVATION: To maximize the chances of biological discovery, homology searching must use an up-to-date collection of sequences. However, the available sequence databases are growing rapidly and are partially redundant in content. This leads to increasing strain on CPU resources and decreasing density of first-hand annotation. RESULTS: These problems are addressed by clustering closely similar sequences to yield a covering of sequence space by a representative subset of sequences. No pair of sequences in the representative set has >90% mutual sequence identity. The representative set is derived by an exhaustive search for close similarities in the sequence database in which the need for explicit sequence alignment is significantly reduced by applying deca- and pentapeptide composition filters. The algorithm was applied to the union of the Swissprot, Swissnew, Trembl, Tremblnew, Genbank, PIR, Wormpep and PDB databases. The all-against-all comparison required to generate a representative set at 90% sequence identity was accomplished in 2 days CPU time, and the removal of fragments and close similarities yielded a size reduction of 46%, from 260 000 unique sequences to 140 000 representative sequences. The practical implications are (i) faster homology searches using, for example, Fasta or Blast, and (ii) unified annotation for all sequences clustered around a representative. As tens of thousands of sequence searches are performed daily world-wide, appropriate use of the non-redundant database can lead to major savings in computer resources, without loss of efficacy. AVAILABILITY: A regularly updated non-redundant protein sequence database (nrdb90), a server for homology searches against nrdb90, and a Perl script (nrdb90.pl) implementing the algorithm are available for academic use from http://www.embl-ebi.ac. uk/holm/nrdb90. CONTACT: holm@embl-ebi.ac.uk
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
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
Hidden Markov model speed heuristic and iterative HMM search procedure
Johnson, L. S., Eddy, S. R., & Portugaly, E. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-431 · Cited by 1,378
Gough, J., Karplus, K., Hughey, R., & Chothia, C. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2001.5080 · Cited by 1,224
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
FoldIndex(C): a simple tool to predict whether a given protein sequence is intrinsically unfolded
Prilusky, J., Felder, C. E., Zeev-Ben-Mordehai, T., Rydberg, E. H., Man, O., Beckmann, J. S., Silman, I., & Sussman, J. L. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti537 · Cited by 916
Marine DNA Viral Macro- and Microdiversity from Pole to Pole
Gregory, A. C., Zayed, A. A., Conceição-Neto, N., Temperton, B., Bolduc, B., Alberti, A., Ardyna, M., Arkhipova, K., Carmichael, M., Cruaud, C., et al. (2019) · Cell · doi:10.1016/j.cell.2019.03.040 · Cited by 826
The continuing conundrum of the LEA proteins
Tunnacliffe, A., & Wise, M. J. (2007) · Naturwissenschaften · doi:10.1007/s00114-007-0254-y · Cited by 738
Assessing the evolutionary impact of amino acid mutations in the human genome.
Boyko, A. R., Williamson, S. H., Indap, A. R., Degenhardt, J. D., Hernandez, R. D., Lohmueller, K. E., Adams, M. D., Schmidt, S., Sninsky, J. J., Sunyaev, S. R., et al. (2008) · PLoS Genetics · doi:10.1371/journal.pgen.1000083 · Cited by 628
Park, J., Karplus, K., Barrett, C., Hughey, R., Haussler, D., Hubbard, T., & Chothia, C. (1998) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.2221 · Cited by 559
Tolerating some redundancy significantly speeds up clustering of large protein databases
Li, W., Jaroszewski, L., & Godzik, A. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.1.77 · Cited by 516
Clustering Algorithms in Biomedical Research: A Review
Xu, R., & Wunsch, D. C. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2083647 · Cited by 349
Ahmad, S., Gromiha, M. M., & Sarai, A. (2004) · Bioinformatics · doi:10.1093/bioinformatics/btg432 · Cited by 345
Rapid automatic detection and alignment of repeats in protein sequences
Heger, A., & Holm, L. (2000) · Proteins: Structure, Function, and Genetics · doi:10.1002/1097-0134(20001101)41:2<224::aid-prot70>3.0.co;2-z · Cited by 334
Self-citationWei, L., Tang, J., & Zou, Q. (2017) · Information Sciences · doi:10.1016/j.ins.2016.06.026 · Cited by 258
The multidrug/oligosaccharidyl‐lipid/polysaccharide (MOP) exporter superfamily
Hvorup, R. N., Winnen, B., Chang, A. B., Jiang, Y., Zhou, X., & Saier, M. H. (2003) · European Journal of Biochemistry · doi:10.1046/j.1432-1033.2003.03418.x · Cited by 256
Cohen, R., Elhadad, M., & Elhadad, N. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-10 · Cited by 121
Metadata
- Authors
- Holm, L., & Sander, C.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 1998-06-01
- Volume
- 14
- Issue
- 5
- Pages
- 423-429
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2062296203
- Cited by
- 294
- References
- 0
- FWCI
- 4.84
- 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
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.