ASIA unversity:Item 310904400/112895
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21693706      線上人數 : 648
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/112895


    題名: A Parallel Algorithm to Generate Connected Network Motifs
    作者: 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
    貢獻者: 生物資訊與醫學工程學系
    關鍵詞: Graph theory;Parallel algorithms;Topology;Algorithms;Parallel programming Author Supplied Keywords;Digraphs;Isomorphic Graphs;Molecular Networks;Network Motifs;Permutation Matrices
    日期: 2019-11
    上傳時間: 2020-09-01 07:46:52 (UTC+0)
    出版者: 亞洲大學
    摘要: 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.)
    關聯: IAENG International Journal of Computer Science
    顯示於類別:[生物資訊與醫學工程學系 ] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML268檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


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