Qin G and Gao L (2012) An algorithm for network motif discovery in biological networks. Int J Data Min Bioinform 6(1):1-16
Abstract: Network motif discovery is a key problem in analysis of biological networks. In this paper, we present an efficient algorithm for detecting consensus motifs. First, we extend subgraph searching algorithm Enumerate Subgraphs (ESU) to efficiently search non-treelike subgraphs of which the probability of occurrence in random networks is small. Then, we classify isomorphic subgraphs into different groups. Finally, we use hierarchical clustering method to cluster subgraphs, and derive a consensus motif from the clusters. Our algorithm is applied to the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae. The experiment results show that the algorithm can efficiently discover motifs, which are consistent with current biology knowledge. And, it can also detect several consensus motifs with a given size, which may help biologists go further into cellular process.
|Status: Published||Type: Journal Article | Research Support, Non-U.S. Gov't||PubMed ID: 22479815|
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.