{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T08:17:13Z","timestamp":1777277833269,"version":"3.51.4"},"reference-count":8,"publisher":"Oxford University Press (OUP)","issue":"19","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,10,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Biological sequence data is accumulating rapidly, motivating the development of improved high-throughput methods for sequence classification.<\/jats:p>\n               <jats:p>Results: UBLAST and USEARCH are new algorithms enabling sensitive local and global search of large sequence databases at exceptionally high speeds. They are often orders of magnitude faster than BLAST in practical applications, though sensitivity to distant protein relationships is lower. UCLUST is a new clustering method that exploits USEARCH to assign sequences to clusters. UCLUST offers several advantages over the widely used program CD-HIT, including higher speed, lower memory use, improved sensitivity, clustering at lower identities and classification of much larger datasets.<\/jats:p>\n               <jats:p>Availability: Binaries are available at no charge for non-commercial use at http:\/\/www.drive5.com\/usearch<\/jats:p>\n               <jats:p>Contact: \u00a0robert@drive5.com<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btq461","type":"journal-article","created":{"date-parts":[[2010,8,14]],"date-time":"2010-08-14T00:13:54Z","timestamp":1281744834000},"page":"2460-2461","source":"Crossref","is-referenced-by-count":18699,"title":["Search and clustering orders of magnitude faster than BLAST"],"prefix":"10.1093","volume":"26","author":[{"given":"Robert C.","family":"Edgar","sequence":"first","affiliation":[{"name":"Tiburon, CA 94920, USA"}]}],"member":"286","published-online":{"date-parts":[[2010,8,12]]},"reference":[{"key":"2023012508171834400_B1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","article-title":"Basic local alignment search tool","volume":"215","author":"Altschul","year":"1990","journal-title":"J. Mol. Biol."},{"key":"2023012508171834400_B2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-7799(01)01603-1","article-title":"Challenges in bioinformatics: infrastructure, models and analytics","volume":"19","author":"Butte","year":"2001","journal-title":"Trends Biotechnol."},{"key":"2023012508171834400_B3","doi-asserted-by":"crossref","first-page":"1694","DOI":"10.1126\/science.1177486","article-title":"Bacterial community variation in human body habitats across space and time","volume":"326","author":"Costello","year":"2009","journal-title":"Science"},{"key":"2023012508171834400_B4","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1093\/nar\/gkh180","article-title":"Local homology recognition and distance measures in linear time using compressed amino acid alphabets","volume":"32","author":"Edgar","year":"2004","journal-title":"Nucleic Acids Res."},{"key":"2023012508171834400_B5","doi-asserted-by":"crossref","first-page":"1792","DOI":"10.1093\/nar\/gkh340","article-title":"MUSCLE: multiple sequence alignment with high accuracy and high throughput","volume":"32","author":"Edgar","year":"2004","journal-title":"Nucleic Acids Res."},{"key":"2023012508171834400_B6","doi-asserted-by":"crossref","first-page":"D281","DOI":"10.1093\/nar\/gkm960","article-title":"The Pfam protein families database","volume":"36","author":"Finn","year":"2008","journal-title":"Nucleic Acids Res."},{"key":"2023012508171834400_B7","doi-asserted-by":"crossref","first-page":"D136","DOI":"10.1093\/nar\/gkn766","article-title":"Rfam: updates to the RNA families database","volume":"37","author":"Gardner","year":"2009","journal-title":"Nucleic Acids Res."},{"key":"2023012508171834400_B8","doi-asserted-by":"crossref","first-page":"1658","DOI":"10.1093\/bioinformatics\/btl158","article-title":"Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences","volume":"22","author":"Li","year":"2006","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/19\/2460\/48857155\/bioinformatics_26_19_2460.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/19\/2460\/48857155\/bioinformatics_26_19_2460.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T08:18:57Z","timestamp":1674634737000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/26\/19\/2460\/230188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,12]]},"references-count":8,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2010,10,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btq461","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2010,10,1]]},"published":{"date-parts":[[2010,8,12]]}}}