title: Improved K-means clustering algorithm for exploring local protein sequence motifs representing common structural property.
abstract: Information about local protein sequence motifs is very important to the analysis of biologically significant conserved regions of protein sequences. These conserved regions can potentially determine the diverse conformation and activities of proteins. In this work, recurring sequence motifs of proteins are explored with an improved K-means clustering algorithm on a new dataset. The structural similarity of these recurring sequence clusters to produce sequence motifs is studied in order to evaluate the relationship between sequence motifs and their structures. To the best of our knowledge, the dataset used by our research is the most updated dataset among similar studies for sequence motifs. A new greedy initialization method for the K-means algorithm is proposed to improve traditional K-means clustering techniques. The new initialization method tries to choose suitable initial points, which are well separated and have the potential to form high-quality clusters. Our experiments indicate that the improved K-means algorithm satisfactorily increases the percentage of sequence segments belonging to clusters with high structural similarity. Careful comparison of sequence motifs obtained by the improved and traditional algorithms also suggests that the improved K-means clustering algorithm may discover some relatively weak and subtle sequence motifs, which are undetectable by the traditional K-means algorithms. Many biochemical tests reported in the literature show that these sequence motifs are biologically meaningful. Experimental results also indicate that the improved K-means algorithm generates more detailed sequence motifs representing common structures than previous research. Furthermore, these motifs are universally conserved sequence patterns across protein families, overcoming some weak points of other popular sequence motifs. The satisfactory result of the experiment suggests that this new K-means algorithm may be applied to other areas of bioinformatics research in order to explore the underlying relationships between data samples more effectively.
authors.affiliation: Computer Science Department, Georgia State University, Atlanta, GA 30303-4110, USA. jetzhong@yahoo.com
authors.forename: Wei
authors.initials: W
authors.lastname: Zhong
authors.forename: Gulsah
authors.initials: G
authors.lastname: Altun
authors.forename: Robert
authors.initials: R
authors.lastname: Harrison
authors.forename: Phang C
authors.initials: PC
authors.lastname: Tai
authors.forename: Yi
authors.initials: Y
authors.lastname: Pan
mesh_terms: D000465:Algorithms; D020816:Amino Acid Motifs; D000595:Amino Acid Sequence; D016000:Cluster Analysis; D017124:Conserved Sequence; D008969:Molecular Sequence Data; D010363:Pattern Recognition, Automated / Q000379:methods*; D011487:Protein Conformation; D011506:Proteins / Q000032:analysis* / Q000737:chemistry*; D016415:Sequence Alignment / Q000379:methods*; D020539:Sequence Analysis, Protein / Q000379:methods*; D017386:Sequence Homology, Amino Acid
chemical_list: D011506:Proteins