A faster algorithm for detecting network motifs

Authors:
Sebastian Wernicke
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany
Venue:
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Year:
2005

Citing 4
Cited 3

A Fast Approximation Algorithm for Computing theFrequencies of Subgraphs in a Given Graph

SIAM Journal on Computing
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

Bioinformatics
Conserved network motifs allow protein--protein interaction prediction

Bioinformatics
Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution

Bioinformatics

Keyword search over RDF graphs

Proceedings of the 20th ACM international conference on Information and knowledge management
Symmetry Compression Method for Discovering Network Motifs

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
G-Tries: a data structure for storing and finding subgraphs

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Kashtan et al. [Bioinformatics, 2004] proposed a sampling algorithm for efficiently performing the computationally challenging task of detecting network motifs. However, among other drawbacks, this algorithm suffers from sampling bias and is only efficient when the motifs are small (3 or 4 nodes). Based on a detailed analysis of the previous algorithm, we present a new algorithm for network motif detection which overcomes these drawbacks. Experiments on a testbed of biological networks show our algorithm to be orders of magnitude faster than previous approaches. This allows for the detection of larger motifs in bigger networks than was previously possible, facilitating deeper insight into the field.