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

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 c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proteins, structure, function, and bioinformatics Ročník 78; číslo 10; s. 2283 - 2294
Hlavní autoři: Tuncbag, Nurcan, Salman, F. Sibel, Keskin, Ozlem, Gursoy, Attila
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.08.2010
Témata:
Algorithms
Amino Acids - chemistry
Amino Acids - metabolism
Animals
Binding Sites
Computational Biology - methods
Databases, Protein
hot region
hotspot
Humans
mincut tree
Models, Biological
Protein Binding
Protein Conformation
Proteins - chemistry
Proteins - metabolism
residue contact network
Surface Properties
visualization
ISSN:0887-3585, 1097-0134, 1097-0134
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. © 2010 Wiley‐Liss, Inc.
Bibliografie:ArticleID:PROT22741
ark:/67375/WNG-DZT7DJ4L-1
istex:E0D26B40BDC9E3B270F2F2FD7B145874F1552E70
TUBITAK - No. Research Grant No 109T343; No. 109E207
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0887-3585
1097-0134
1097-0134
DOI:10.1002/prot.22741