This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
acc-Motif: Accelerated Network Motif Detection
PrePrint
ISSN: 1545-5963
L.A.A. Meira, L. A. A. Meira is with the School of Technology, University of Campinas, Brazil. (E-mail: meira@ft.unicamp.br).
Network motif algorithms have been a topic of research mainly after the 2002-seminal paper from Milo et al. [20], which provided motifs as a way to uncover the basic building blocks of most networks. Motifs have been mainly applied in Bioinformatics, regarding gene regulation networks. Motif detection is based on induced subgraph counting. This paper proposes an algorithm to count subgraphs of size k + 2 based on the set of induced subgraphs of size k. The general technique was applied to detect 3, 4 and 5-sized motifs in directed graphs. Such algorithms have time complexity O(a(G)m), O(m2) and O(nm2), respectively, where a(G) is the arboricity of G(V,E). The computational experiments in public datasets show that the proposed technique was one order of magnitude faster than Kavosh and FANMOD. When compared to NetMODE, acc-Motif had a slightly improved performance.
Citation:
A.L. Fazenda, V.R. Maximo, A.F. da Conceicao, L.A.A. Meira, "acc-Motif: Accelerated Network Motif Detection," IEEE/ACM Transactions on Computational Biology and Bioinformatics, 22 May 2014. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TCBB.2014.2321150>
Usage of this product signifies your acceptance of the Terms of Use.