title: A graph-theoretic algorithm for comparative modeling of protein structure.
abstract: The interconnected nature of interactions in protein structures appears to be the major hurdle in preventing the construction of accurate comparative models. We present an algorithm that uses graph theory to handle this problem. Each possible conformation of a residue in an amino acid sequence is represented using the notion of a node in a graph. Each node is given a weight based on the degree of the interaction between its side-chain atoms and the local main-chain atoms. Edges are then drawn between pairs of residue conformations/nodes that are consistent with each other (i.e. clash-free and satisfying geometrical constraints). The edges are weighted based on the interactions between the atoms of the two nodes. Once the entire graph is constructed, all the maximal sets of completely connected nodes (cliques) are found using a clique-finding algorithm. The cliques with the best weights represent the optimal combinations of the various main-chain and side-chain possibilities, taking the respective environments into account. The algorithm is used in a comparative modeling scenario to build side-chains, regions of main chain, and mix and match between different homologs in a context-sensitive manner. The predictive power of this method is assessed by applying it to cases where the experimental structure is not known in advance.
authors.affiliation: Center for Advanced Research in Biotechnology, University of Maryland Biotechnology Institute, Rockville 20850, USA.
authors.forename: R
authors.initials: R
authors.lastname: Samudrala
authors.forename: J
authors.initials: J
authors.lastname: Moult
mesh_terms: D000465:Algorithms; D019992:Databases as Topic; D008956:Models, Chemical; D011487:Protein Conformation