Sequence clustering

In bioinformatics, sequence clustering algorithms attempt to group biological sequences that are somehow related. The sequences can be either of genomic, "transcriptomic" (ESTs) or protein origin. For proteins, homologous sequences are typically grouped into families. For EST data, clustering is important to group sequences originating from the same gene before the ESTs are assembled to reconstruct the original mRNA.

Some clustering algorithms use single-linkage clustering, constructing a transitive closure of sequences with a similarity over a particular threshold. UCLUST^[1] and CD-HIT^[2] use a greedy algorithm that identifies a representative sequence for each cluster and assigns a new sequence to that cluster if it is sufficiently similar to the representative; if a sequence is not matched then it becomes the representative sequence for a new cluster. The similarity score is often based on sequence alignment. Sequence clustering is often used to make a non-redundant set of representative sequences.

Sequence clusters are often synonymous with (but not identical to) protein families. Determining a representative tertiary structure for each sequence cluster is the aim of many structural genomics initiatives.

This article reads like a directory. Wikipedia policy generally considers directories in articles to be unencyclopedic and potential spam. Please improve this article to conform to a higher standard of quality, and to make it neutral in tone. If it cannot be properly modified, the article is likely to be merged, redirected, or deleted. (September 2018) (Learn how and when to remove this message)

• CD-HIT^[2]
• UCLUST in USEARCH^[1]
• Starcode:^[3] a fast sequence clustering algorithm based on exact all-pairs search.^[4]
• OrthoFinder:^[5] a fast, scalable and accurate method for clustering proteins into gene families (orthogroups)^[6][7]
• Linclust:^[8] first algorithm whose runtime scales linearly with input set size, very fast, part of MMseqs2^[9] software suite for fast, sensitive sequence searching and clustering of large sequence sets
• TribeMCL: a method for clustering proteins into related groups^[10]
• BAG: a graph theoretic sequence clustering algorithm^[11]
• JESAM:^[12] Open source parallel scalable DNA alignment engine with optional clustering software component
• UICluster:^[13] Parallel Clustering of EST (Gene) Sequences
• BLASTClust single-linkage clustering with BLAST^[14]
• Clusterer:^[15] extendable java application for sequence grouping and cluster analyses
• PATDB: a program for rapidly identifying perfect substrings
• nrdb:^[16] a program for merging trivially redundant (identical) sequences
• CluSTr:^[17] A single-linkage protein sequence clustering database from Smith-Waterman sequence similarities; covers over 7 mln sequences including UniProt and IPI
• ICAtools^[18] - original (ancient) DNA clustering package with many algorithms useful for artifact discovery or EST clustering
• Skipredudant EMBOSS tool^[19] to remove redundant sequences from a set
• CLUSS Algorithm^[20] to identify groups of structurally, functionally, or evolutionarily related hard-to-align protein sequences. CLUSS webserver ^[21]
• CLUSS2 Algorithm^[22] for clustering families of hard-to-align protein sequences with multiple biological functions. CLUSS2 webserver ^[21]

• PISCES: A Protein Sequence Culling Server^[23]
• RDB90^[24]
• UniRef: A non-redundant UniProt sequence database^[25]
• Uniclust: A clustered UniProtKB sequences at the level of 90%, 50% and 30% pairwise sequence identity.^[26]
• Virus Orthologous Clusters:^[27] A viral protein sequence clustering database; contains all predicted genes from eleven virus families organized into ortholog groups by BLASTP similarity

• Cluster analysis
• Social sequence analysis