期刊名称：IAENG International Journal of Computer Science
印刷版ISSN：1819-656X
电子版ISSN：1819-9224
出版年度：2019
卷号：46
期号：4
页码：518-523
出版社：IAENG - International Association of Engineers
摘要：Network of interactions among bio-molecules is fundamental to biological processes. Many works have shown that molecular networks can be analyzed by decomposing the networks into smaller modules named network motifs. to elucidate the complex topology of a network. To achieve this goal, it requires to determine the complete set of motifs that are compose of five connected nodes.We developed an algorithm to remove motifs compose of disconnected components and implemented a parallelized algorithm to reduce the computation time. Our experiment demonstrated that the proposed parallel algorithm is approximately 1.3 times faster than serial programming for identifying 5-node motifs with all the nodes connected.
