IDEAS home Printed from https://ideas.repec.org/a/igg/jskd00/v13y2021i1p52-64.html
   My bibliography  Save this article

Hybrid High-Performance Computing Algorithm for Gene Regulatory Network

Author

Listed:
  • Dina Elsayad

    (Faculty of Computer and Information Sciences, Ain Shams University, Egypt)

  • Safawat Hamad

    (Ain Shams University, Egypt)

  • Howida Abd-Alfatah Shedeed

    (Faculty of Computer and Information Sciences, Ain Shams University, Egypt)

  • Mohamed Fahmy Tolba

    (Faculty of Computer and Information Sciences, Ain Shams University, Egypt)

Abstract

This paper presents a parallel algorithm for gene regulatory network construction, hereby referred to as H2pcGRN. The construction of gene regulatory network is a vital methodology for investigating the genes interactions' topological order, annotating the genes functionality and demonstrating the regulatory process. One of the approaches for gene regulatory network construction techniques is based on the component analysis method. The main drawbacks of component analysis-based algorithms are its intensive computations that consume time. Despite these drawbacks, this approach is widely applied to infer the regulatory network. Therefore, introducing parallel techniques is indispensable for gene regulatory network inference algorithms. H2pcGRN is a hybrid high performance-computing algorithm for gene regulatory network inference. The proposed algorithm is based on both the hybrid parallelism architecture and the generalized cannon's algorithm. A variety of gene datasets is used for H2pcGRN assessment and evaluation. The experimental results indicated that H2pcGRN achieved super-linear speedup, where its computational speedup reached 570 on 256 processing nodes.

Suggested Citation

  • Dina Elsayad & Safawat Hamad & Howida Abd-Alfatah Shedeed & Mohamed Fahmy Tolba, 2021. "Hybrid High-Performance Computing Algorithm for Gene Regulatory Network," International Journal of Sociotechnology and Knowledge Development (IJSKD), IGI Global, vol. 13(1), pages 52-64, January.
  • Handle: RePEc:igg:jskd00:v:13:y:2021:i:1:p:52-64
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSKD.2021010105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jskd00:v:13:y:2021:i:1:p:52-64. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.