Dense graphlet statistics of protein interaction and random networks

R. Colak, Fereydoun Hormozdiari, F. Moser, A. Schönhuth, J. Holman, M. Ester, S. C. Sahinalp

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

Understanding evolutionary dynamics from a systemic point of view crucially depends on knowledge about how evolution affects size and structure of the organisms' functional building blocks (modules). It has been recently reported that statistics over sparse PPI graphlets can robustly monitor such evolutionary changes. However, there is abundant evidence that in PPI networks modules can be identified with highly interconnected (dense) and/or bipartite sub-graphs. We count such dense graphlets in PPI networks by employing recently developed search strategies that render related inference problems tractable. We demonstrate that corresponding counting statistics differ significantly between prokaryotes and eukaryotes as well as between "real" PPI networks and scale free network emulators. We also prove that another class of emulators, the low-dimensional geometric random graphs (GRGs) cannot contain a specific type of motifs, complete bipartite graphs, which are abundant in PPI networks.

Original languageEnglish (US)
Title of host publicationPacific Symposium on Biocomputing 2009, PSB 2009
Pages178-189
Number of pages12
StatePublished - Dec 1 2009
Externally publishedYes
Event14th Pacific Symposium on Biocomputing, PSB 2009 - Kohala Coast, HI, United States
Duration: Jan 5 2009Jan 9 2009

Other

Other14th Pacific Symposium on Biocomputing, PSB 2009
CountryUnited States
CityKohala Coast, HI
Period1/5/091/9/09

Fingerprint

Protein Interaction Maps
Statistics
Proteins
Complex networks
Eukaryota

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Biomedical Engineering
  • Medicine(all)

Cite this

Colak, R., Hormozdiari, F., Moser, F., Schönhuth, A., Holman, J., Ester, M., & Sahinalp, S. C. (2009). Dense graphlet statistics of protein interaction and random networks. In Pacific Symposium on Biocomputing 2009, PSB 2009 (pp. 178-189)

Dense graphlet statistics of protein interaction and random networks. / Colak, R.; Hormozdiari, Fereydoun; Moser, F.; Schönhuth, A.; Holman, J.; Ester, M.; Sahinalp, S. C.

Pacific Symposium on Biocomputing 2009, PSB 2009. 2009. p. 178-189.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Colak, R, Hormozdiari, F, Moser, F, Schönhuth, A, Holman, J, Ester, M & Sahinalp, SC 2009, Dense graphlet statistics of protein interaction and random networks. in Pacific Symposium on Biocomputing 2009, PSB 2009. pp. 178-189, 14th Pacific Symposium on Biocomputing, PSB 2009, Kohala Coast, HI, United States, 1/5/09.
Colak R, Hormozdiari F, Moser F, Schönhuth A, Holman J, Ester M et al. Dense graphlet statistics of protein interaction and random networks. In Pacific Symposium on Biocomputing 2009, PSB 2009. 2009. p. 178-189
Colak, R. ; Hormozdiari, Fereydoun ; Moser, F. ; Schönhuth, A. ; Holman, J. ; Ester, M. ; Sahinalp, S. C. / Dense graphlet statistics of protein interaction and random networks. Pacific Symposium on Biocomputing 2009, PSB 2009. 2009. pp. 178-189
@inproceedings{2901e446a91d49d5aba5f317ae9b136f,
title = "Dense graphlet statistics of protein interaction and random networks",
abstract = "Understanding evolutionary dynamics from a systemic point of view crucially depends on knowledge about how evolution affects size and structure of the organisms' functional building blocks (modules). It has been recently reported that statistics over sparse PPI graphlets can robustly monitor such evolutionary changes. However, there is abundant evidence that in PPI networks modules can be identified with highly interconnected (dense) and/or bipartite sub-graphs. We count such dense graphlets in PPI networks by employing recently developed search strategies that render related inference problems tractable. We demonstrate that corresponding counting statistics differ significantly between prokaryotes and eukaryotes as well as between {"}real{"} PPI networks and scale free network emulators. We also prove that another class of emulators, the low-dimensional geometric random graphs (GRGs) cannot contain a specific type of motifs, complete bipartite graphs, which are abundant in PPI networks.",
author = "R. Colak and Fereydoun Hormozdiari and F. Moser and A. Sch{\"o}nhuth and J. Holman and M. Ester and Sahinalp, {S. C.}",
year = "2009",
month = "12",
day = "1",
language = "English (US)",
isbn = "9812836926",
pages = "178--189",
booktitle = "Pacific Symposium on Biocomputing 2009, PSB 2009",

}

TY - GEN

T1 - Dense graphlet statistics of protein interaction and random networks

AU - Colak, R.

AU - Hormozdiari, Fereydoun

AU - Moser, F.

AU - Schönhuth, A.

AU - Holman, J.

AU - Ester, M.

AU - Sahinalp, S. C.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Understanding evolutionary dynamics from a systemic point of view crucially depends on knowledge about how evolution affects size and structure of the organisms' functional building blocks (modules). It has been recently reported that statistics over sparse PPI graphlets can robustly monitor such evolutionary changes. However, there is abundant evidence that in PPI networks modules can be identified with highly interconnected (dense) and/or bipartite sub-graphs. We count such dense graphlets in PPI networks by employing recently developed search strategies that render related inference problems tractable. We demonstrate that corresponding counting statistics differ significantly between prokaryotes and eukaryotes as well as between "real" PPI networks and scale free network emulators. We also prove that another class of emulators, the low-dimensional geometric random graphs (GRGs) cannot contain a specific type of motifs, complete bipartite graphs, which are abundant in PPI networks.

AB - Understanding evolutionary dynamics from a systemic point of view crucially depends on knowledge about how evolution affects size and structure of the organisms' functional building blocks (modules). It has been recently reported that statistics over sparse PPI graphlets can robustly monitor such evolutionary changes. However, there is abundant evidence that in PPI networks modules can be identified with highly interconnected (dense) and/or bipartite sub-graphs. We count such dense graphlets in PPI networks by employing recently developed search strategies that render related inference problems tractable. We demonstrate that corresponding counting statistics differ significantly between prokaryotes and eukaryotes as well as between "real" PPI networks and scale free network emulators. We also prove that another class of emulators, the low-dimensional geometric random graphs (GRGs) cannot contain a specific type of motifs, complete bipartite graphs, which are abundant in PPI networks.

UR - http://www.scopus.com/inward/record.url?scp=61949235526&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=61949235526&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9812836926

SN - 9789812836922

SP - 178

EP - 189

BT - Pacific Symposium on Biocomputing 2009, PSB 2009

ER -