Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Journal of Information Technology and Its Utilization Journal of Information Technology and its Utilization
Efendi Zaenudin
The National Research and Innovation Agency Republic Indonesia
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Mechanical Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Parallel Matrix Multiplication Algorithms Acquire Connected Network Motifs Efendi Zaenudin; Ka-Lok Ng
Journal of Information Technology and Its Utilization Vol 6 No 1 (2023): June 2023
Publisher : Sekolah Tinggi Multi Media "MMTC" Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The network of interactions between biomolecules is essential to biological processes. Many studies have shown that molecular networks can be analyzed by breaking them down into smaller modules known as network motifs. We hypothesize that identifying the set of possible 5-node motifs and 6-node motifs embedded in a network is a necessary step to elucidate the complex topology of a network. Accomplishing this goal requires determining the complete set of motifs that are composed of five and six connected nodes. We developed a parallel algorithm to reduce time consumption that tackles the exponential problem. It is implemented in matrix multiplication insert in the process of identifying isomorphic patterns and removing the isolated and disconnected patterns. The experiment showed that the parallelization matrix multiplication algorithm is approximately 1.4 times faster than serial programming for identifying 5-node motifs and approximately 1.3 times faster than serial programming for identifying 6-node motifs with all the nodes connected
Parallel Matrix Multiplication Algorithms Acquire Connected Network Motifs Efendi Zaenudin; Ka-Lok Ng
Journal of Information Technology and Its Utilization Vol 6 No 1 (2023): June 2023
Publisher : Sekolah Tinggi Multi Media

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.56873/jitu.6.1.4983

Abstract

The network of interactions between biomolecules is essential to biological processes. Many studies have shown that molecular networks can be analyzed by breaking them down into smaller modules known as network motifs. We hypothesize that identifying the set of possible 5-node motifs and 6-node motifs embedded in a network is a necessary step to elucidate the complex topology of a network. Accomplishing this goal requires determining the complete set of motifs that are composed of five and six connected nodes. We developed a parallel algorithm to reduce time consumption that tackles the exponential problem. It is implemented in matrix multiplication insert in the process of identifying isomorphic patterns and removing the isolated and disconnected patterns. The experiment showed that the parallelization matrix multiplication algorithm is approximately 1.4 times faster than serial programming for identifying 5-node motifs and approximately 1.3 times faster than serial programming for identifying 6-node motifs with all the nodes connected
Co-Authors Ka-Lok Ng