Speaker:
Time:
Venue:
- A-212 (STCS Seminar Room)
In our scheme, we represent each protein structure as an unweighted undirected graph with amino acid residues being the nodes. The nodes are connected with an edge if the corresponding amino acid residues are spatially proximal in the structure. Each functional site is represented as a clique in this set up. We extract candidate functional sites from each protein using Bron-Kerbosch clique finding algorithm. Now, the objective is to determine most likely functional sites from a large number of candidate sites. The work is founded on the well characterized biological knowledge that the functionally important substructures are conserved and recur in functionally related proteins. We represent the candidate functional sites using geometric invariants, which remain unchanged upon transformations like rotation and translation. The candidate sites are grouped, using machine learning techniques, based on their similarity in a space spanned by geometric invariants. The recurring candidate sites are analyzed to provide a rank list of possible functional sites to the experimental biologists. Finally, I will present a few examples of successful application of this method in novel proteins.