مشاهده مشخصات مقاله
PKavosh: A New Parallel Approach to Motif Finding
|
نویسنده (ها) |
-
Hassan ketabi
-
Mohammadreza A. Oskoei
|
|
مربوط به کنفرانس |
سمپوزیوم علوم کامپیوتر و مهندسی نرمافزار 2013 |
|
چکیده |
In networks, motifs are small-connected sub-graphs with higher frequency occurrence than in random networks. It has recently gathered muchattention as a concept to uncover structural design principles of complex biological networks. Finding motifs in a network is a very challenging and time-consuming process. Several algorithms and improvements have been proposed. One of the best-known tools that can find motifs in a complex network is Kavosh. In this paper, we present a parallel version of Kavosh, named PKavosh, which uses parallel sub-graph enumeration for motif finding. Experimental results show excellent scalability on this problem, achieving a speedup of 7 on 8 processors |
|
قیمت |
-
برای اعضای سایت : ۱٠٠,٠٠٠ ریال
-
برای دانشجویان عضو انجمن : ۲٠,٠٠٠ ریال
-
برای اعضای عادی انجمن : ۴٠,٠٠٠ ریال
|
خرید مقاله
|
|
.gif){kind=icon}