MTMO: an efficient network-centric algorithm for subtree counting and enumeration | |
Guanghui Li; Jiawei Luo; Zheng Xiao; Cheng Liang | |
刊名 | 定量生物学(英文版) |
2018 | |
卷号 | 第6卷 第2期页码:142-154 |
关键词 | complex network evolutionary systems biology network motif discovery subtree counting subtree isomorphism |
URL标识 | 查看原文 |
公开日期 | [db:dc_date_available] |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/5458200 |
专题 | 湖南大学 |
作者单位 | College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China;School of Information Engineering, East China Jiaotong University, Nanchang 330013, China;College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China |
推荐引用方式 GB/T 7714 | Guanghui Li,Jiawei Luo,Zheng Xiao,et al. MTMO: an efficient network-centric algorithm for subtree counting and enumeration[J]. 定量生物学(英文版),2018,第6卷 第2期:142-154. |
APA | Guanghui Li,Jiawei Luo,Zheng Xiao,&Cheng Liang.(2018).MTMO: an efficient network-centric algorithm for subtree counting and enumeration.定量生物学(英文版),第6卷 第2期,142-154. |
MLA | Guanghui Li,et al."MTMO: an efficient network-centric algorithm for subtree counting and enumeration".定量生物学(英文版) 第6卷 第2期(2018):142-154. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论