Next Article in Journal
Effect of Oxylipins, Terpenoid Precursors and Wounding on Soft Corals’ Secondary Metabolism as Analyzed via UPLC/MS and Chemometrics
Next Article in Special Issue
Multi-Objective Optimization Algorithm to Discover Condition-Specific Modules in Multiple Networks
Previous Article in Journal
Novel Effective Small-Molecule Antibacterials against Enterococcus Strains
Previous Article in Special Issue
A Seed Expansion Graph Clustering Method for Protein Complexes Detection in Protein Interaction Networks
Article Menu
Issue 12 (December) cover image

Export Article

Open AccessArticle
Molecules 2017, 22(12), 2194;

Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation Networks

1,2,* and 1
School of Computer Science, Northwestern Polytechnical University, West Youyi Road 127, Xi’an 710072, China
Centre for Multidisciplinary Convergence Computing, School of Computer Science, Northwestern Polytechnical University, Dong Xiang Road 1, Xi’an 710129, China
Author to whom correspondence should be addressed.
Received: 4 November 2017 / Revised: 28 November 2017 / Accepted: 5 December 2017 / Published: 10 December 2017
Full-Text   |   PDF [4366 KB, uploaded 10 December 2017]   |  


Network motifs are patterns of complex networks occurring significantly more frequently than those in random networks. They have been considered as fundamental building blocks of complex networks. Therefore, the detection of network motifs in transcriptional regulation networks is a crucial step in understanding the mechanism of transcriptional regulation and network evolution. The search for network motifs is similar to solving subgraph searching problems, which has proven to be NP-complete. To quickly and effectively count subgraphs of a large biological network, we propose a novel graph canonization algorithm based on resolving sets. This method has been implemented in a command line interface (CLI) program sgip using the SeqAn library. Comparing to Babai’s algorithm, this approach has a tighter complexity bound, o ( exp ( n log 2 n + 4 log n ) ) , on strongly regular graphs. Results on several simulated datasets and transcriptional regulation networks indicate that sgip outperforms nauty on many graph cases. The source code of sgip is freely accessible in and the binary code in View Full-Text
Keywords: network motif; algorithms; graph canonization network motif; algorithms; graph canonization

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Hu, J.; Shang, X. Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation Networks. Molecules 2017, 22, 2194.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Molecules EISSN 1420-3049 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top