Parallel discovery of network motifs

@article{Ribeiro2012ParallelDO,
  title={Parallel discovery of network motifs},
  author={Pedro Manuel Pinto Ribeiro and Fernando M. A. Silva and Lu{\'i}s M. B. Lopes},
  journal={J. Parallel Distrib. Comput.},
  year={2012},
  volume={72},
  pages={144-154}
}
Many natural structures can be naturally represented by complex networks. Discovering network motifs, which are overrepresented patterns of inter-connections, is a computationally hard task related to graph isomorphism. Sequential methods are hindered by an exponential execution time growth when we increase the size of motifs and networks. In this article we study the opportunities for parallelism in existing methods and propose new parallel strategies that adapt and extend one of the most… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

Network Motif Discovery: A GPU Approach

IEEE Transactions on Knowledge and Data Engineering • 2015
View 20 Excerpts
Highly Influenced

High-performance parallel frequent subgraph discovery

The Journal of Supercomputing • 2015
View 2 Excerpts

Fast Priority: A strategy to reduce processing time in a motif discovery tool like Priority

2014 IEEE Colombian Conference on Communications and Computing (COLCOM) • 2014
View 2 Excerpts

Parallel Subgraph Counting for Multicore Architectures

2014 IEEE International Symposium on Parallel and Distributed Processing with Applications • 2014
View 6 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 48 references

Efficient Detection of Network Motifs

IEEE/ACM Transactions on Computational Biology and Bioinformatics • 2006
View 5 Excerpts
Highly Influenced

Network motifs: simple building blocks of complex networks.

Science • 2002
View 5 Excerpts
Highly Influenced

A

M. Schatz, E. Cooper-Balis
Bazinet, Parallel network motif finding • 2008
View 4 Excerpts
Highly Influenced

Practical graph isomorphism, II

J. Symb. Comput. • 2014
View 1 Excerpt

Efficient Parallel Subgraph Counting Using G-Tries

2010 IEEE International Conference on Cluster Computing • 2010
View 3 Excerpts

Similar Papers

Loading similar papers…