Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences

Motivation: In 2001 and 2002, we published two papers (Bioinformatics, 17, 282–283, Bioinformatics, 18, 77–82) describing an ultrafast protein sequence clustering program called cd-hit. This program can efficiently cluster a huge protein database with millions of sequences. However, the applications...

Full description

Saved in:
Bibliographic Details
Published inBioinformatics Vol. 22; no. 13; pp. 1658 - 1659
Main Authors Li, Weizhong, Godzik, Adam
Format Journal Article
LanguageEnglish
Published Oxford Oxford University Press 01.07.2006
Oxford Publishing Limited (England)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Motivation: In 2001 and 2002, we published two papers (Bioinformatics, 17, 282–283, Bioinformatics, 18, 77–82) describing an ultrafast protein sequence clustering program called cd-hit. This program can efficiently cluster a huge protein database with millions of sequences. However, the applications of the underlying algorithm are not limited to only protein sequences clustering, here we present several new programs using the same algorithm including cd-hit-2d, cd-hit-est and cd-hit-est-2d. Cd-hit-2d compares two protein datasets and reports similar matches between them; cd-hit-est clusters a DNA/RNA sequence database and cd-hit-est-2d compares two nucleotide datasets. All these programs can handle huge datasets with millions of sequences and can be hundreds of times faster than methods based on the popular sequence comparison and database search tools, such as BLAST. Availability: Contact:liwz@sdsc.edu
Bibliography:Associate Editor: Golan Yona
istex:56FF6C45E6D69E965E2CABA99308A8C60A33307A
ark:/67375/HXZ-PG1KG21Q-C
To whom correspondence should be addressed.
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1367-4803
1460-2059
1367-4811
DOI:10.1093/bioinformatics/btl158