首页    期刊浏览 2024年11月26日 星期二
登录注册

文章基本信息

  • 标题:An Algorithm to Construct Network Motifs for Bioinformatics Study
  • 本地全文:下载
  • 作者:Efendi Zaenudin ; Ezra B. Wijaya ; Eskezeia Y. Dessie
  • 期刊名称:Lecture Notes in Engineering and Computer Science
  • 印刷版ISSN:2078-0958
  • 电子版ISSN:2078-0966
  • 出版年度:2019
  • 卷号:2239
  • 页码:45-50
  • 出版社:Newswood and International Association of Engineers
  • 摘要:Biological network is formed by the interaction between the genetic elements. It is known that biological functions and processes can be understood in terms of network structures. To analyze a real network, one can decompose the network into smaller modules, so-called network motifs. Motif is a fundamental entity of real networks and it exhibits specific functions or properties. For a digraph, the number of possible patterns for N-node-motifs grows exponentially. In this paper, we propose a systematic method which can generate all the allowed network motifs without bipartite, isolated and isomorphic motifs. We illustrated our approach by applying it to generate the complete sets of both 3-node-motifs and 4-node-motifs. It is expected that our algorithm can be applied to construct 5-node-motifs by parallelizing the algorithm.
  • 关键词:Biological Networks; Digraphs; Network Motifs; Isomorphic Graphs; Permutation Matrices;
国家哲学社会科学文献中心版权所有