title: Clustering of highly homologous sequences to reduce the size of large protein databases.
abstract: We present a fast and flexible program for clustering large protein databases at different sequence identity levels. It takes less than 2 h for the all-against-all sequence comparison and clustering of the non-redundant protein database of over 560,000 sequences on a high-end PC. The output database, including only the representative sequences, can be used for more efficient and sensitive database searches.
authors: San Diego Supercomputer Center, La Jolla, CA 92093, USA. liwz@sdsc.edu
authors: W
authors: W
authors: Li
authors: L
authors: L
authors: Jaroszewski
authors: A
authors: A
authors: Godzik
mesh_terms: D000465:Algorithms; D016208:Databases, Factual; D011506:Proteins / Q000032:analysis*; D017421:Sequence Analysis; D012984:Software
chemical_list: D011506:Proteins