ASIA unversity:Item 310904400/112895
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90452/105769 (86%)
造访人次 : 11946459      在线人数 : 405
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    题名: 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 15:46:52 (UTC+8)
    出版者: 亞洲大學
    摘要: 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
    显示于类别:[生物資訊與醫學工程學系 ] 期刊論文


    档案 描述 大小格式浏览次数


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