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 条
  • [21] Efficient graph topologies in network routing games
    Epstein, Amir
    Feldman, Michal
    Mansour, Yishay
    GAMES AND ECONOMIC BEHAVIOR, 2009, 66 (01) : 115 - 125
  • [22] An Efficient Anchor-Free Localization Algorithm for all Cluster Topologies in a Wireless Sensor Network
    Aka, Ahoua Cyrille
    Atta, Amanvon Ferdinand
    Keupondjo, Satchou Gilles Armel
    Oumtanaga, Souleymane
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2023, 18 (03)
  • [23] Resource efficient maintenance of wireless network topologies
    Lukovszki, Tamas
    Schindelhauer, Christian
    Volbert, Klaus
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2006, 12 (09) : 1292 - 1311
  • [24] Adaptive Bloom Filter: A space-efficient counting algorithm for unpredictable network traffic
    Matsumoto, Yoshihide
    Hazeyama, Hiroaki
    Kadobayashi, Youki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (05) : 1292 - 1299
  • [25] Kavosh: a new algorithm for finding network motifs
    Kashani, Zahra Razaghi Moghadam
    Ahrabian, Hayedeh
    Elahi, Elahe
    Nowzari-Dalini, Abbas
    Ansari, Elnaz Saberi
    Asadi, Sahar
    Mohammadi, Shahin
    Schreiber, Falk
    Masoudi-Nejad, Ali
    BMC BIOINFORMATICS, 2009, 10 : 318
  • [26] Kavosh: a new algorithm for finding network motifs
    Zahra Razaghi Moghadam Kashani
    Hayedeh Ahrabian
    Elahe Elahi
    Abbas Nowzari-Dalini
    Elnaz Saberi Ansari
    Sahar Asadi
    Shahin Mohammadi
    Falk Schreiber
    Ali Masoudi-Nejad
    BMC Bioinformatics, 10
  • [27] A parallel algorithm to generate connected network motifs
    Zaenudin, Efendi
    Wijaya, Ezra Bernadus
    Dessie, Eskezeia Yihunie
    Reddy, Mekala Venugopala
    Tsai, Jeffrey J.P.
    Huang, Chien-Hung
    Ng, Ka-Lok
    IAENG International Journal of Computer Science, 2019, 46 (04) : 1 - 6
  • [28] A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets
    Ribeiro, Pedro
    Paredes, Pedro
    Silva, Miguel E. P.
    Aparicio, David
    Silva, Fernando
    ACM COMPUTING SURVEYS, 2021, 54 (02)
  • [29] Efficient Dissemination Algorithm for Scale-Free Topologies
    Hu, Ruijing
    Sopena, Julien
    Arantes, Luciana
    Sens, Pierre
    Demeure, Isabelle
    2013 42ND ANNUAL INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2013, : 310 - 319
  • [30] Efficient Counting of the Number of Independent Sets on Polygonal Trees
    De Ita, Guillermo
    Bello, Pedro
    Contreras, Meliza
    Catana-Salazar, Juan C.
    PATTERN RECOGNITION (MCPR 2016), 2016, 9703 : 167 - 176
12345