ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies

被引：0
|
作者：
Yuanfang Ren
Aisharjya Sarkar
Tamer Kahveci
机构：
[1] Department of Computer & Information Science & Engineering,
来源：
BMC Bioinformatics | / 19卷
关键词：
Independent motif counting; Probabilistic networks; Polynomial;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies
    Ren, Yuanfang
    Sarkar, Aisharjya
    Kahveci, Tamer
    BMC BIOINFORMATICS, 2018, 19
  • [2] An optimal algorithm for counting network motifs
    Itzhack, Royl
    Mogilevski, Yelena
    Louzoun, Yoram
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2007, 381 : 482 - 490
  • [3] A New Algorithm for Counting Independent Motifs in Probabilistic Networks
    Sarkar, Aisharjya
    Ren, Yuanfang
    Elhesha, Rasha
    Kahveci, Tamer
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2019, 16 (04) : 1049 - 1062
  • [4] Counting independent motifs in probabilistic networks
    Sarkar, Aisharjya
    Ren, Yuanfang
    Elhesha, Rasha
    Kahveci, Tamer
    PROCEEDINGS OF THE 7TH ACM INTERNATIONAL CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY, AND HEALTH INFORMATICS, 2016, : 231 - 240
  • [5] Efficient Analytical Computation of Expected Frequency of Motifs of Small Size by Marginalization in Uncertain Network
    Fushimi, Takayasu
    Saito, Kazumi
    Motoda, Hiroshi
    PROCEEDINGS OF THE 2021 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING, ASONAM 2021, 2021, : 1 - 8
  • [6] Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
    Kashtan, N
    Itzkovitz, S
    Milo, R
    Alon, U
    BIOINFORMATICS, 2004, 20 (11) : 1746 - 1758
  • [7] An efficient counting network
    Busch, Costas
    Mavronicolas, Marios
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (34-36) : 3001 - 3030
  • [8] An efficient counting network
    Busch, C
    Mavronicolas, M
    FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, 1998, : 380 - 384
  • [9] Efficient detection of network motifs
    Wernicke, Sebastian
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2006, 3 (04) : 347 - 359
  • [10] MTMO: an efficient network-centric algorithm for subtree counting and enumeration
    Li, Guanghui
    Luo, Jiawei
    Xiao, Zheng
    Liang, Cheng
    QUANTITATIVE BIOLOGY, 2018, 6 (02) : 142 - 154
12345