Analysis and network representation of hotspots in protein interfaces using minimum cut trees

Date

2010-08-01

Author

Tunçbağ, Nurcan
Keskin, Ozlem
GÜRSOY, Attila

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

193
views

0
downloads

We propose a novel approach to analyze and visualize residue contact networks of protein interfaces by graph-based algorithms using a minimum cut tree (mincut tree). Edges in the network are weighted according to an energy function derived from knowledge-based potentials. The mincut tree, which is constructed from the weighted residue network, simplifies and summarizes the complex structure of the contact network by an efficient and informative representation. This representation offers a comprehensible view of critical residues and facilitates the inspection of their organization. We observed, on a nonredundant data set of 38 protein complexes with experimental hotspots that the highest degree node in the mincut tree usually corresponds to an experimental hotspot. Further, hotspots are found in a few paths in the mincut tree. In addition, we examine the organization of hotspots (hot regions) using an iterative clustering algorithm on two different case studies. We find that distinct hot regions are located on specific sites of the mincut tree and some critical residues hold these clusters together. Clustering of the interface residues provides information about the relation of hot regions with each other. Our new approach is useful at the molecular level for both identification of critical paths in the protein interfaces and extraction of hot regions by clustering of the interface residues. Proteins 2010; 78:2283-2294. (C) 2010 Wiley-Liss, Inc.

Subject Keywords

Hotspot, Mincut tree, Residue contact network, Visualization, Hot region

URI

https://hdl.handle.net/11511/31620

Journal

PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS

DOI

https://doi.org/10.1002/prot.22741

Collections

Graduate School of Informatics, Article

Suggestions

OpenMETU
Core

Implicit monolithic parallel solution algorithm for seismic analysis of dam-reservoir systems Özmen, Semih; Kurç, Özgür; Department of Civil Engineering (2016) This research mainly focuses on developing a computationally scalable and efficient solution algorithm that can handle linear dynamic analysis of dam-reservoir interaction problem. Lagrangian fluid finite elements are utilized and compressibility and viscosity of the fluid are taken into consideration during the reservoir modeling. In order to provide computational scalability and efficiency, domain decomposition methods implemented with parallel computing approaches such as Finite Element Tearing and Inter...
Analysis of Face Recognition Algorithms for Online and Automatic Annotation of Personal Videos Yılmaztürk, Mehmet; Ulusoy Parnas, İlkay; Çiçekli, Fehime Nihan (Springer, Dordrecht; 2010-05-08) Different from previous automatic but offline annotation systems, this paper studies automatic and online face annotation for personal videos/episodes of TV series considering Nearest Neighbourhood, LDA and SVM classification with Local Binary Patterns, Discrete Cosine Transform and Histogram of Oriented Gradients feature extraction methods in terms of their recognition accuracies and execution times. The best performing feature extraction method and the classifier pair is found out to be SVM classification...
Optimization of well placement geothermal reservoirs using artificial intelligence Akın, Serhat; Kök, Mustafa Verşan (2010-06-01) This research proposes a framework for determining the optimum location of an injection well using an inference method, artificial neural networks and a search algorithm to create a search space and locate the global maxima. A complex carbonate geothermal reservoir (Kizildere Geothermal field, Turkey) production history is used to evaluate the proposed framework. Neural networks are used as a tool to replicate the behavior of commercial simulators, by capturing the response of the field given a limited numb...
Design of looped water distribution networks using a heuristic approach Ateş, Halil İbrahim; Merzi, Nuri.; Department of Civil Engineering (2019) This study aims to design pipe diameters of a water distribution network using a heuristic approach algorithm. The heuristic approach algorithm aims to maximize the reliability of the network while minimizing the total cost of the water distribution network, which is a multi-objective optimization problem. In a water distribution network, the resilience index is defined as network reliability (Todini, 2000). The cost of the water distribution network is the total cost of the network pipes. In this heuristic...
HotSprint: database of computational hot spots in protein interfaces Guney, Emre; Tunçbağ, Nurcan; Keskin, Ozlem; Gursoy, Attila (2008-01-01) We present a new database of computational hot spots in protein interfaces: HotSprint. Hot spots are residues comprising only a small fraction of interfaces yet accounting for the majority of the binding energy. HotSprint contains data for 35 776 protein interfaces among 49 512 protein interfaces extracted from the multi-chain structures in Protein Data Bank (PDB) as of February 2006. The conserved residues in interfaces with certain buried accessible solvent area (ASA) and complex ASA thresholds are flagge...

Citation Formats

N. Tunçbağ, O. Keskin, and A. GÜRSOY, “Analysis and network representation of hotspots in protein interfaces using minimum cut trees,” PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, pp. 2283–2294, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/31620.