BROWSE

Related Researcher

Author's Photo

Bhak, Jong
KOrean GenomIcs Center(KOGIC)
Research Interests
  • Geromics, genomics, bioinformatics, protein Engineering, OMICS

ITEM VIEW & DOWNLOAD

Generating protein interaction maps from incomplete data: Application to fold assignment

Cited 0 times inthomson ciCited 24 times inthomson ci
Title
Generating protein interaction maps from incomplete data: Application to fold assignment
Author
Lappe, MichaelBhak, Jong HwaNiggemann, OliverHolm, Liisa
Keywords
algorithm; article; biology; chemistry; cluster analysis; comparative study; evaluation; metabolism; protein database; protein folding; statistical analysis; two hybrid system
Issue Date
2001
Publisher
OXFORD UNIV PRESS
Citation
BIOINFORMATICS, v.17, no.SUPPL. 1, pp.S149 - S156
Abstract
Motivation: We present a framework to generate comprehensive overviews of protein-protein interactions. In the post-genomic view of cellular function, each biological entity is seen in the context of a complex network of interactions. Accordingly, we model functional space by representing protein-protein-interaction data as undirected graphs. We suggest a general approach to generate interaction maps of cellular networks in the presence of huge amounts of fragmented and incomplete data, and to derive representations of large networks which hide clutter while keeping the essential architecture of the interaction space. This is achieved by contracting the graphs according to domain-specific hierarchical classifications. The key concept here is the notion of induced interaction, which allows the integration, comparison and analysis of interaction data from different sources and different organisms at a given level of abstraction. Results: We apply this approach to compute the overlap between the DIP compendium of interaction data and a dataset of yeast two-hybrid experiments. The architecture of this network is scale-free, as frequently seen in biological networks, and this property persists through many levels of abstraction. Connections in the network can be projected downwards from higher levels of abstraction down to the level of individual proteins. As an example, we describe an algorithm for fold assignment by network context. This method currently predicts protein folds at 30% accuracy without any requirement of detectable sequence similarity of the query protein to a protein of known structure. We used this algorithm to compile a list of structural assignments for previously unassigned genes from yeast. Finally we discuss ways forward to use interaction networks for the prediction of novel protein-protein interactions. © Oxford University Press 2001
URI
Go to Link
DOI
10.1093/bioinformatics/17.suppl_1.S1
ISSN
1367-4803
Appears in Collections:
BME_Journal Papers
Files in This Item:
Bioinformatics-2001-Lappe-S149-56.pdf Download

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qrcode

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU