Using hybrid hierarchical K-means (HHK) clustering algorithm for protein sequence motif super-rule-tree (SRT) structure construction.
Many algorithms or techniques to discover motifs require a predefined fixed window size in advance. Because of the fixed size, these approaches often deliver a number of similar motifs simply shifted by some bases or including mismatches. To confront the mismatched motifs problem, we use the super-rule concept to construct a Super-Rule-Tree (SRT) by a modified Hybrid Hierarchical K-means (HHK) clustering algorithm, which requires no parameter set-up to identify the similarities and dissimilarities between the motifs. By analysing the motif results generated by our approach, they are significant not only in sequence area but also in secondary structure similarity.
Chen
Bernard
B
Department of Computer Science, University of Central Arkansas, 201 Donaghey Avenue, Conway, AR 72035, USA. bchen@uca.edu
He
Jieyue
J
Pellicer
Stephen
S
Pan
Yi
Y
D000465:Algorithms; D020816:Amino Acid Motifs; D000595:Amino Acid Sequence; D016000:Cluster Analysis; D010363:Pattern Recognition, Automated / Q000379:methods; D017433:Protein Structure, Secondary; D011506:Proteins / Q000737:chemistry*; D020539:Sequence Analysis, Protein / Q000379:methods*
D011506:Proteins