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

Tunçbağ, Nurcan
Keskin, Ozlem
GÜRSOY, Attila
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.


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...
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...
An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks
Deniz, Fatih; Bagci, Hakki; KÖRPEOĞLU, İBRAHİM; Yazıcı, Adnan (2016-07-01)
This paper introduces an adaptive, energy-aware and distributed fault-tolerant topology control algorithm, namely the Adaptive Disjoint Path Vector (ADPV) algorithm, for heterogeneous wireless sensor networks. In this heterogeneous model, we have resource-rich supernodes as well as ordinary sensor nodes that are supposed to be connected to the supernodes. Unlike the static alternative Disjoint Path Vector (DPV) algorithm, the focus of ADPV is to secure supernode connectivity in the presence of node failures...
Building Morphological Chains for Agglutinative Languages
Ozen, Serkan; CAN BUĞLALILAR, BURCU (2017-04-23)
In this paper, we build morphological chains for agglutinative languages by using a log linear model for the morphological segmentation task. The model is based on the unsupervised morphological segmentation system called MorphoChains [1]. We extend MorphoChains log linear model by expanding the candidate space recursively to cover more split points for agglutinative languages such as Turkish, whereas in the original model candidates are generated by considering only binary segmentation of each word. The re...
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: