Article thumbnail
Location of Repository

Biomolecular network motif counting and discovery by color coding

By Noga Alon, Phuong Dao, Iman Hajirasouliha, Fereydoun Hormozdiari and S. Cenk Sahinalp


Protein–protein interaction (PPI) networks of many organisms share global topological features such as degree distribution, k-hop reachability, betweenness and closeness. Yet, some of these networks can differ significantly from the others in terms of local structures: e.g. the number of specific network motifs can vary significantly among PPI networks

Topics: Ismb 2008 Conference Proceedings 19–23 July 2008, Toronto
Publisher: Oxford University Press
OAI identifier:
Provided by: PubMed Central

Suggested articles


  1. (2001). A random graph model for power law graphs.
  2. (2002). Approximation algorithms for some parameterized counting problems.
  3. (2007). Balanced families of perfect hash functions and their applications.
  4. (2002). Dip, the database of interacting proteins: a research tool for studying cellular networks of protein interactions.
  5. (2003). Duplication models for biological networks.
  6. (2005). Effect of sampling on topology predictions of protein–protein interaction networks.
  7. (2006). Efficient algorithms for detecting signaling pathways in protein interaction networks.
  8. (2004). Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs.
  9. (1999). Emergence of scaling in random networks.
  10. (2004). Modeling interactome: scale-free or geometric?
  11. (2003). Modelling of protein interaction networks.
  12. (1983). Monte-carlo algorithms for enumeration and reliability problems.
  13. (2007). Network motif discovery using subgraph enumeration and symmetry-breaking.
  14. (2002). Network motifs: simple building blocks of complex networks.
  15. (2007). Not all scale-free networks are born equal: the role of the seed graph in ppi network evolution.
  16. (1959). On random graphs.
  17. (2003). Preferential attachment in the protein network evolution.
  18. (2007). Qnet: a tool for querying protein interaction networks.
  19. (2006). Qpath: a method for querying pathways in a protein–protein interaction network.
  20. (2006). The degree distribution of the generalized duplication model.
  21. (2001). The degree sequence of a scale-free random graph process.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.