PRIGSA: protein repeat identification by graph spectral analysis.
Repetition of a structural motif within protein is associated with a wide range of structural and functional roles. In most cases the repeating units are well conserved at the structural level while at the sequence level, they are mostly undetectable suggesting the need for structure-based methods. Since most known methods require a training dataset, de novo approach is desirable. Here, we propose an efficient graph-based approach for detecting structural repeats in proteins. In a protein structure represented as a graph, interactions between inter- and intra-repeat units are well captured by the eigen spectra of adjacency matrix of the graph. These conserved interactions give rise to similar connections and a unique profile of the principal eigen spectra for each repeating unit. The efficacy of the approach is shown on eight repeat families annotated in UniProt, comprising of both solenoid and nonsolenoid repeats with varied secondary structure architecture and repeat lengths. The performance of the approach is also tested on other known benchmark datasets and the performance compared with two repeat identification methods. For a known repeat type, the algorithm also identifies the type of repeat present in the protein. A web tool implementing the algorithm is available at the URL http://bioinf.iiit.ac.in/PRIGSA/.
Centre for Computational Natural Sciences and Bioinformatics, International Institute of Information Technology, Hyderabad, India.
Broto
B
Chakrabarty
Nita
N
Parekh
D000465:Algorithms; D003198:Computer Simulation; D008956:Models, Chemical; D008958:Models, Molecular; D008969:Molecular Sequence Data; D017510:Protein Folding; D017433:Protein Structure, Secondary; D011506:Proteins / Q000737:chemistry* / Q000648:ultrastructure*; D020449:Repetitive Sequences, Amino Acid; D020539:Sequence Analysis, Protein / Q000379:methods*; D012984:Software
D011506:Proteins
Protein structural repeat; graph theory; protein contact network