Efficient Detection of Network Motifs

@article{Wernicke2006EfficientDO,
  title={Efficient Detection of Network Motifs},
  author={Sebastian Wernicke},
  journal={IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  year={2006},
  volume={3}
}
  • S. Wernicke
  • Published 1 October 2006
  • Computer Science, Medicine
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
Motifs in a given network are small connected subnetworks that occur in significantly higher frequencies than would be expected in random networks. They have recently gathered much attention as a concept to uncover structural design principles of complex networks. Kashtan et al. [Bioinformatics, 2004] proposed a sampling algorithm for performing the computationally challenging task of detecting network motifs. However, among other drawbacks, this algorithm suffers from a sampling bias and… 
Identification of large disjoint motifs in biological networks
TLDR
A scalable algorithm for finding network motifs that proves that any motif with four or more edges can be constructed as a join of the small patterns and introduces a set of small patterns that can construct any larger pattern by joining those patterns iteratively.
MODA: an efficient algorithm for network motif discovery in biological networks.
TLDR
This paper presents a new algorithm (MODA) that incorporates techniques such as a pattern growth approach for extracting larger motifs efficiently and is able to identifylarger motifs with more than 8 nodes more efficiently than most of the current state-of-the-art motif discovery algorithms.
Counting motifs in dynamic networks
TLDR
A scalable method for counting the number of motifs in a dynamic biological network that incrementally updates the frequency of each motif as the underlying network’s topology evolves and can be scaled to large dense networks.
Building blocks of biological networks: a review on major network motif discovery algorithms.
TLDR
The authors will give a review on computational aspects of major algorithms and enumerate their related benefits and drawbacks from an algorithmic perspective.
NetMODE: Network Motif Detection without Nauty
TLDR
An implementation of a network motif detection package that can perform motif detection for node subgraphs when [Formula: see text], but does so without the use of Nauty, and includes a method for generating comparison graphs uniformly at random.
Efficiently counting complex multilayer temporal motifs in large-scale networks
TLDR
This paper proposes novel algorithms for efficiently counting complex network motifs in dynamic networks that are changing over time, and delineates the “computational frontier” of temporal motif counting algorithms.
Detecting multiple stochastic network motifs in network data
TLDR
The use of a finite mixture model to detect multiple stochastic network motifs is proposed and it is demonstrated that it outperformed the deterministic motif detection algorithm FANMOD as well as the conventional EM algorithm in terms of its robustness against noise.
Efficient and Scalable Algorithms for Network Motifs Discovery
TLDR
A novel data-structure, g-tries, designed to represent a collection of graphs, is proposed, Akin to a prefix tree, which takes advantage of common substructures to both reduce the memory needed to store the graphs, and to produce a new more efficient sequential algorithm to compute their frequency as subgraphs of another larger graph.
Counting Multilayer Temporal Motifs in Complex Networks
TLDR
This work proposes an extension of an existing counting algorithm to also efficiently count multilayer temporal motifs, and demonstrates how partial timing, a common phenomenon in real-world settings where only part of the layers are timed, can be incorporated.
Network Motifs Detection Using Random Networks with Prescribed Subgraph Frequencies
TLDR
This paper proposes a method for generating random graphs under the classical null model, and provides algorithms for its efficient computation, and shows empirical results of the proposed methodology on neurobiological networks.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 43 REFERENCES
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
TLDR
A novel algorithm is presented that allows estimation of subgraph concentrations and detection of network motifs at a runtime that is asymptotically independent of the network size and can be applied to estimate the concentrations of larger subgraphs in larger networks than was previously possible with exhaustive enumeration algorithms.
FANMOD: a tool for fast network motif detection
TLDR
FANMOD relies on recently developed algorithms to improve the efficiency of network motif detection by some orders of magnitude over existing tools, which facilitates the detection of larger motifs in bigger networks than previously possible.
An efficient algorithm for detecting frequent subgraphs in biological networks
TLDR
An innovative new algorithm for detecting frequently occurring patterns and modules in biological networks is presented, using an innovative graph simplification technique, which is ideally suited to biological networks.
Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution
TLDR
This work presents a computational method to enumerate the most likely m networks and to extract a widely common subgraph (denoted as gene network motif) from these and reveals that geneNetwork motifs are in significantly better agreement to biological knowledge than optimal network models.
Local graph alignment and motif search in biological networks.
  • Johannes Berg, M. Lässig
  • Computer Science, Physics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2004
TLDR
A statistical model for the occurrence of topological motifs derived from families of mutually similar but not necessarily identical patterns is established, from which a scoring function for their statistical significance is derived.
Network motifs: simple building blocks of complex networks.
TLDR
Network motifs, patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks, are defined and may define universal classes of networks.
The topological relationship between the large-scale attributes and local interaction patterns of complex networks
TLDR
It is shown that a network's large-scale topological organization and its local subgraph structure mutually define and predict each other, as confirmed by direct measurements in five well studied cellular networks.
Subgraphs in random networks.
TLDR
It is found that certain subgraphs appear much more frequently than in Erdos networks, and the power exponent of the degree distribution, gamma, is used as a control parameter, and it is shown that random networks exhibit transitions between three regimes.
Network motifs in the transcriptional regulation network of Escherichia coli
TLDR
This work applied new algorithms for systematically detecting network motifs to one of the best-characterized regulation networks, that of direct transcriptional interactions in Escherichia coli, and finds that much of the network is composed of repeated appearances of three highly significant motifs.
Superfamilies of Evolved and Designed Networks
TLDR
An approach to systematically study similarity in the local structure of networks, based on the significance profile (SP) of small subgraphs in the network compared to randomized networks, finds several superfamilies of previously unrelated networks with very similar SPs.
...
1
2
3
4
5
...