An Efficient Sampling Algorithm for Network Motif Detection
From MaRDI portal
Recommendations
- Motif discovery in networks: a survey
- An analytical approach to network motif detection in samples of networks with pairwise different vertex labels
- An efficient algorithm for discovering probability motifs in biological networks
- Approximating the number of network motifs
- Approximating the Number of Network Motifs
- Research and design of a statistical way for Motif in networks
Cites work
Cited in
(8)- Motif discovery in networks: a survey
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
- A motif building process for simulating random networks
- Fast methods for finding significant motifs on labelled multi-relational networks
- An analytical approach to network motif detection in samples of networks with pairwise different vertex labels
- A uniform random graph model for directed acyclic networks and its effect on motif-finding
- Shortest path tree sampling for landmark selection in large networks
- On the efficacy of higher-order spectral clustering under weighted stochastic block models
This page was built for publication: An Efficient Sampling Algorithm for Network Motif Detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391081)