SGD Paper Help



Chang RL, et al.  (2010) Deterministic graph-theoretic algorithm for detecting modules in biological interaction networks. Int J Bioinform Res Appl 6(2):101-19

Abstract: An approach for module identification, Modules of Networks (MoNet), introduced an intuitive module definition and clear detection method using edges ranked by the Girvan-Newman algorithm. Modules from a yeast network showed significant association with biological processes, indicating the method's utility; however, systematic bias leads to varied results across trials. MoNet modules also exclude some network regions. To address these shortcomings, we developed a deterministic version of the Girvan-Newman algorithm and a new agglomerative algorithm, Deterministic Modularization of Networks (dMoNet). dMoNet simultaneously processes structurally equivalent edges while preserving intuitive foundations of the MoNet algorithm and generates modules with full network coverage.

Status: Published Type: Journal Article PubMed ID: 20223734

Topics addressed in this paper

  • To find other papers on a gene and topic, click on the colored ball in the appropriate box.
  • displays other papers with information about that topic for that gene.
  • displays other papers in SGD that are associated with that topic.
    The topic is addressed in these papers but does not describe a specific gene or chromosomal feature.
  • To go to the Locus page for a gene, click on the gene name.
Topics Topics not linked to Genes
Computational analysis yg ball
Omics yg ball

Author Searches

To find contact information or other publications by the authors of this paper, follow these three steps:
  1. (1) Choose an author,
  2. (2) Choose a search parameter,
  3. (3) Click to implement