کنفرانس بین المللی فناوری اطلاعات و دانش

صفحه اصلی / یازدهمین کنفرانس بین المللی فناوری اطلاعات و دانش

ParaKavosh: A Parallel Algorithm for Finding Biological Network Motifs

نویسندگان :

Zahra Razaghi Moghadam Kashani¹ Ali Masoudi-nejad² Abbas Nowzari-dalini³

1- موسسه ماکس پلانک 2- دانشگاه تهران 3- دانشگاه تهران

کلمات کلیدی :

Network Motifs, Bioinformatics, Parallel Algorithms

چکیده :

Biological networks have recently gathered much attraction in finding their motifs, which are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They are useful concept to uncover structural design principles of complex networks. The importance of this problem causes attention of improving the existing algorithms. As the running time of an algorithm is an important aspect, applying parallel techniques is appropriate for better improvement. In this paper we present a parallel algorithm (ParaKavosh) for finding motifs. We evaluated our algorithm on biological networks of E. coli, S. cerevisiae, Homo sapiens and Rattus norvegicus. The optimality of our algorithm is demonstrated by comparing the obtained results with an efficient sequential algorithm. The results show that our algorithm performs much better in terms of running time.