Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Weizhong Li
Lukasz Jaroszewski
Adam Godzik
Bioinformatics
San Diego Supercomputer Center
Building similarity graph...
Analyzing shared references across papers
Loading...
Li et al. (Thu,) studied this question.
www.synapsesocial.com/papers/69d8ab6a945c639271bedb0f — DOI: https://doi.org/10.1093/bioinformatics/17.3.282
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: