2014
DOI: 10.1109/tcbb.2014.2321150
|View full text |Cite
|
Sign up to set email alerts
|

acc-Motif: Accelerated Network Motif Detection

Abstract: Network motif algorithms have been a topic of research mainly after the 2002-seminal paper from Milo et al. [1], 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-size… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
3
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(18 citation statements)
references
References 10 publications
0
18
0
Order By: Relevance
“…Substantial research effort has been devoted to dealing with the algorithmic challenges of network motif identification and the related graph algorithms [17,22,1,28]. This has led to the development of a number of computational tools, including mfinder [12], MAVisto [25], NeMoFinder [6], FANMOD [29], Grochow-Kellis [9], Kavosh [11], MODA [30], NetMODE [14], Acc-MOTIF [18] and QuateXelero [13] (see also [28] for a review and detailed comparisons). Verification techniques have also been applied to study network motifs.…”
Section: Introductionmentioning
confidence: 99%
“…Substantial research effort has been devoted to dealing with the algorithmic challenges of network motif identification and the related graph algorithms [17,22,1,28]. This has led to the development of a number of computational tools, including mfinder [12], MAVisto [25], NeMoFinder [6], FANMOD [29], Grochow-Kellis [9], Kavosh [11], MODA [30], NetMODE [14], Acc-MOTIF [18] and QuateXelero [13] (see also [28] for a review and detailed comparisons). Verification techniques have also been applied to study network motifs.…”
Section: Introductionmentioning
confidence: 99%
“…It can be seen that with the size of motif grows, the time needed to identify it increases exponentially. Even more efficient network motif detection tools have been developed, the time complexity to detect four-nodes motifs in directed graphs is O(m 2 ), where m is the number of edges in the network 51 . Furthermore, after obtaining the motifs, it takes time to enumerate all cases for each motif pattern.…”
Section: Discussionmentioning
confidence: 99%
“…Milo et al [20] introduced this method and launched MFINDER [21] in 2003. FANMOD [22] surpassed its predecessors in performance, becoming one of the standard tools in motif detection [23]. The network motif detection task has a huge computational cost.…”
Section: Definition 3 No-crossing Closed Quadmentioning
confidence: 99%