Browsing by Subject "Protein complexes"

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Network-based strategies for discovering functional associations of uncharacterized genes and gene sets
    (2012-12) Wang, Peggy I.; Marcotte, Edward M.
    High-throughput technology is changing the face of research biology, generating an ever growing amount of large-scale data sets. With experiments utilizing next-generation gene sequencing, mass spectrometry, and various other global surveys of proteins, the task of translating the plethora of data into biology has become a daunting task. In response, functional networks have been developed as a means for integrating the data into models of proteomic organization. In these networks, proteins are linked if they are evidenced to operate together in the same function, facilitating predictions about the functions, phenotypes, and disease associations of uncharacterized genes. In this body of work, we explore different applications of this so-called "guilt-by-association" concept to predict loss-of-function phenotypes and diseases associated with genes in yeast, worm, and human. We also scrutinize certain limitations associated with the functional networks, predictive methods, and measures of performance used in our studies. Importantly, the predictive method and performance measure, if not chosen appropriately for the biological objective at hand, can largely distort the results and interpretation of a study. These findings are incorporated in the development of RIDDLE, a method for characterizing whole sets of genes. This machine learning-based method provides a measure of network distance, and thus functional association, between two sets of genes. RIDDLE may be applied to a wide range of potential applications, as we demonstrate with several biological examples, including linking microRNA-450a to ocular development and disease. In the last decade, functional networks have proven to be a useful strategy for interpreting large-scale proteomic and genomic data sets. With the continued growth of genome coverage in networks and the innovation of predictive methods, we will surely advance towards our ultimate goal of understanding the genetic changes that underlie disease.
  • No Thumbnail Available
    Item
    Scoring functions for protein docking and drug design
    (2014-05) Viswanath, Shruthi; Elber, Ron
    Predicting the structure of complexes formed by two interacting proteins is an important problem in computation structural biology. Proteins perform many of their functions by binding to other proteins. The structure of protein-protein complexes provides atomic details about protein function and biochemical pathways, and can help in designing drugs that inhibit binding. Docking computationally models the structure of protein-protein complexes, given three-dimensional structures of the individual chains. Protein docking methods have two phases. In the first phase, a comprehensive, coarse search is performed for optimally docked models. In the second refinement and reranking phase, the models from the first phase are refined and reranked, with the expectation of extracting a small set of accurate models from the pool of thousands of models obtained from the first phase. In this thesis, new algorithms are developed for the refinement and reranking phase of docking. New scoring functions, or potentials, that rank models are developed. These potentials are learnt using large-scale machine learning methods based on mathematical programming. The procedure for learning these potentials involves examining hundreds of thousands of correct and incorrect models. In this thesis, hierarchical constraints were introduced into the learning algorithm. First, an atomic potential was developed using this learning procedure. A refinement procedure involving side-chain remodeling and conjugate gradient-based minimization was introduced. The refinement procedure combined with the atomic potential was shown to improve docking accuracy significantly. Second, a hydrogen bond potential, was developed. Molecular dynamics-based sampling combined with the hydrogen bond potential improved docking predictions. Third, mathematical programming compared favorably to SVMs and neural networks in terms of accuracy, training and test time for the task of designing potentials to rank docking models. The methods described in this thesis are implemented in the docking package DOCK/PIERR. DOCK/PIERR was shown to be among the best automated docking methods in community wide assessments. Finally, DOCK/PIERR was extended to predict membrane protein complexes. A membrane-based score was added to the reranking phase, and shown to improve the accuracy of docking. This docking algorithm for membrane proteins was used to study the dimers of amyloid precursor protein, implicated in Alzheimer's disease.R. DOCK/PIERR was shown to be among the best automated docking methods in community wide assessments. Finally, DOCK/PIERR was extended to predict membrane protein complexes. A membrane-based score was added to the reranking phase, and shown to improve the accuracy of docking. This docking algorithm for membrane proteins was used to study the dimers of amyloid precursor protein, implicated in Alzheimer’s disease.