Parallel Acceleration of Subgraph Enumeration in the Process of Network Motif Detection
暂无分享,去创建一个
[1] Brendan D. McKay,et al. Practical graph isomorphism, II , 2013, J. Symb. Comput..
[2] Alfonso Niño,et al. A Survey of Parallel Programming Models and Tools in the Multi and Many-core Era , 2022 .
[3] Albert-Laszlo Barabasi,et al. Deterministic scale-free networks , 2001 .
[4] S. Shen-Orr,et al. Network motifs: simple building blocks of complex networks. , 2002, Science.
[5] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[6] Sahar Asadi,et al. Kavosh: a new algorithm for finding network motifs , 2009, BMC Bioinformatics.
[7] Yi Pan,et al. Symmetry Compression Method for Discovering Network Motifs , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[8] Sebastian Wernicke,et al. A Faster Algorithm for Detecting Network Motifs , 2005, WABI.
[9] Sebastian Wernicke,et al. Efficient Detection of Network Motifs , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[10] Uri Alon,et al. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..
[11] Joshua A. Grochow,et al. Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking , 2007, RECOMB.
[12] Wooyoung Kim,et al. Network Motif Analysis in Clouds - Subgraph Enumeration with Iterative Hadoop MapReduce , 2016, CloudCom 2016.
[13] Chun-Hsi Huang,et al. Biological network motif detection: principles and practice , 2012, Briefings Bioinform..
[14] F. Schreiber,et al. MODA: an efficient algorithm for network motif discovery in biological networks. , 2009, Genes & genetic systems.