Motif Detection Algorithms is a computational method that systematically identifies statistically overrepresented subgraph patterns within complex networks by distinguishing them from those occurring by chance in randomized network models.
239
Publications
14.8K
Citations
698
Authors
343
Institutions
Publications per year
2017–2026
66
Parents
Publications
239
FANMOD: a tool for fast network motif detection
Sebastian Wernicke, Florian Rasche · Bioinformatics · 2006 · 758 citations · Full text
Local Higher-Order Graph Clustering
Hao Yin, Austin R. Benson, Jure Leskovec et al. · 2017 · 601 citations · Full text
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
Nadav Kashtan, Shalev Itzkovitz, Ron Milo et al. · Bioinformatics · 2004 · 548 citations · Full text
1–5 of 239
Authors
698
- SY
5
h-index
- YS
5
h-index
- KM
4
h-index
- UA
4
h-index
- FX
4
h-index
1–5 of 698
Institutions
343
University of Hong Kong
Pok Fu Lam, Hong Kong
7 h-index
18 publications
851 citations
Tel Aviv University
Tel Aviv, Israel
6 h-index
26 publications
1.9K citations
Dalian University of Technology
Dalian, China
6 h-index
19 publications
757 citations
Stanford University
Stanford, United States
5 h-index
10 publications
2.1K citations
KU Leuven
Leuven, Belgium
5 h-index
25 publications
565 citations
University of Washington
Seattle, United States
5 h-index
9 publications
585 citations
National University of Singapore
Singapore, Singapore
4 h-index
12 publications
708 citations
Institute for Infocomm Research
Singapore, Singapore
4 h-index
12 publications
438 citations
1–8 of 343
Venues
- Bioinformatics
21 publications · 2.7K citations
17
h-index
- BMC Bioinformatics
13 publications · 855 citations
12
h-index
- PLoS ONE
8 publications · 302 citations
8
h-index
- Nucleic Acids Research
5 publications · 252 citations
5
h-index
- Physical Review E
PRE · 5 publications · 316 citations
5
h-index
1–5