ASIA unversity:Item 310904400/112895
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90452/105769 (86%)
Visitors : 11945307      Online Users : 402
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item:

    Title: A Parallel Algorithm to Generate Connected Network Motifs
    Authors: Zaenu, Efendi;Zaenudin, Efendi;Bernadu, Ezra;Wijaya, Ezra Bernadus;Yih, Eskezeia;Dessie, Eskezeia Yihunie;Venug, Mekala;Reddy, Mekala Venugopala;蔡進發;TSAI, JEFFREY J. P.;黃建宏;Huang, Chien-Hung;吳家樂;Ng, Ka-Lok
    Contributors: 生物資訊與醫學工程學系
    Keywords: Graph theory;Parallel algorithms;Topology;Algorithms;Parallel programming Author Supplied Keywords;Digraphs;Isomorphic Graphs;Molecular Networks;Network Motifs;Permutation Matrices
    Date: 2019-11
    Issue Date: 2020-09-01 15:46:52 (UTC+8)
    Publisher: 亞洲大學
    Abstract: 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. We hypothesize that identifying the set of possible 5-node motifs embeds in a network is a necessary step 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. [ABSTRACT FROM AUTHOR]

    Copyright of IAENG International Journal of Computer Science is the property of Newswood Limited and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
    Relation: IAENG International Journal of Computer Science
    Appears in Collections:[Department of Biomedical informatics  ] Journal Article

    Files in This Item:

    File Description SizeFormat

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback