Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Fast and accurate modeling of protein-protein interactions by combining template-interface-based docking with flexible refinement
Date
2012-04-01
Author
Tunçbağ, Nurcan
NUSSINOV, Ruth
Gursoy, Attila
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
152
views
0
downloads
Cite This
The similarity between folding and binding led us to posit the concept that the number of proteinprotein interface motifs in nature is limited, and interacting protein pairs can use similar interface architectures repeatedly, even if their global folds completely vary. Thus, known proteinprotein interface architectures can be used to model the complexes between two target proteins on the proteome scale, even if their global structures differ. This powerful concept is combined with a flexible refinement and global energy assessment tool. The accuracy of the method is highly dependent on the structural diversity of the interface architectures in the template dataset. Here, we validate this knowledge-based combinatorial method on the Docking Benchmark and show that it efficiently finds high-quality models for benchmark complexes and their binding regions even in the absence of template interfaces having sequence similarity to the targets. Compared to classical docking, it is computationally faster; as the number of target proteins increases, the difference becomes more dramatic. Further, it is able to distinguish binders from nonbinders. These features allow performing large-scale network modeling. The results on an independent target set (proteins in the p53 molecular interaction map) show that current method can be used to predict whether a given protein pair interacts. Overall, while constrained by the diversity of the template set, this approach efficiently produces high-quality models of proteinprotein complexes. We expect that with the growing number of known interface architectures, this type of knowledge-based methods will be increasingly used by the broad proteomics community. Proteins 2012; (c) 2011 Wiley Periodicals, Inc.
Subject Keywords
Template-Based Docking
,
Flexible Refinement
,
3D Modeling
,
Protein Interaction Prediction
URI
https://hdl.handle.net/11511/31307
Journal
PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS
DOI
https://doi.org/10.1002/prot.24022
Collections
Graduate School of Informatics, Article
Suggestions
OpenMETU
Core
Deep Learning for Assignment of Protein Secondary Structure Elements from C Coordinates
Nasr, Kamal Al; Sekmen, Ali; Bilgin, Bahadir; Jones, Christopher; Koku, Ahmet Buğra (2021-01-01)
© 2021 IEEE.This paper presents a Deep Neural network (DNN) system that uses a large set of geometric and categorical features for classification of secondary structure elements (SSEs) in the protein's trace that consists of Calpha atoms on the backbone. A systematical approach is implemented for classification of protein SSE problem. This approach consists of two network architecture search (NAS) algorithms for selecting (1) network architecture and layer connectivity, and (2) regularization parameters. Ea...
Improving Hit Ratio of ILP-based Concept Discovery System with Memoization
Mutlu, Alev; Karagöz, Pınar (2014-01-01)
Although Inductive Logic Programming (ILP)-based concept discovery systems have applications in a wide range of domains, they still suffer from scalability and efficiency issues. One of the reasons for the efficiency problem is the high number of query executions necessary in the concept discovery process. Owing to the refinement operator of ILP-based concept discovery systems, these queries repeat frequently. In this work, we propose a method to improve the look-up table hit ratio for repeating queries of ...
Parallel solution of soil-structure interaction problems on pc clusters
Bahçecioğlu, Tunç; Çetin, Kemal Önder; Department of Civil Engineering (2011)
Numerical assessment of soil structure interaction problems require heavy computational efforts because of the dynamic and iterative (nonlinear) nature of the problems. Furthermore, modeling soil-structure interaction may require finer meshes in order to get reliable results. Latest computing technologies must be utilized to achieve results in reasonable run times. This study focuses on development and implantation of a parallel dynamic finite element analysis method for numerical solution of soil-structure i...
Prediction of protein subcellular localization based on primary sequence data
Özarar, Mert; Atalay, Mehmet Volkan; Department of Computer Engineering (2003)
Subcellular localization is crucial for determining the functions of proteins. A system called prediction of protein subcellular localization (P2SL) that predicts the subcellular localization of proteins in eukaryotic organisms based on the amino acid content of primary sequences using amino acid order is designed. The approach for prediction is to nd the most frequent motifs for each protein in a given class based on clustering via self organizing maps and then to use these most frequent motifs as features...
A Framework for Machine Vision based on Neuro-Mimetic Front End Processing and Clustering
Akbaş, Emre; ECKSTEIN, Miguel; MADHOW, Upamanyu (2014-10-03)
Convolutional deep neural nets have emerged as a highly effective approach for machine vision, but there are a number of open issues regarding training (e.g., a large number of model parameters to be learned, and a number of manually tuned algorithm parameters) and interpretation (e.g., geometric interpretations of neurons at various levels of the hierarchy). In this paper, our goal is to explore alternative convolutional architectures which are easier to interpret and simpler to implement. In particular, w...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
N. Tunçbağ, R. NUSSINOV, and A. Gursoy, “Fast and accurate modeling of protein-protein interactions by combining template-interface-based docking with flexible refinement,”
PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS
, pp. 1239–1249, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/31307.