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 条
  • [41] A parallel algorithm for extracting transcriptional regulatory network motifs
    Wang, T
    Touchman, JW
    Zhang, WY
    Suh, EB
    Xue, GL
    BIBE 2005: 5TH IEEE SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING, 2005, : 193 - 200
  • [42] Accurate position and orientation independent step counting algorithm for smartphones
    Seo, Jungryul
    Laine, Teemu H.
    JOURNAL OF AMBIENT INTELLIGENCE AND SMART ENVIRONMENTS, 2018, 10 (06) : 481 - 495
  • [43] An algorithm for counting maximum weighted independent sets and its applications
    Dahllöf, V
    Jonsson, P
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 292 - 298
  • [44] Robust network topologies for generating oscillations with temperature-independent periods
    Wu, Lili
    Ouyang, Qi
    Wang, Hongli
    PLOS ONE, 2017, 12 (02):
  • [45] An Efficient Algorithm for Discovering Motifs in Large DNA Data Sets
    Yu, Qiang
    Huo, Hongwei
    Chen, Xiaoyang
    Guo, Haitao
    Vitter, Jeffrey Scott
    Huan, Jun
    IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2015, 14 (05) : 535 - 544
  • [46] Encoded Expansion: An Efficient Algorithm to Discover Identical String Motifs
    Azmi, Aqil M.
    Al-Ssulami, Abdulrakeeb
    PLOS ONE, 2014, 9 (05):
  • [47] An efficient algorithm for the identification of structured motifs in DNA promoter sequences
    Carvalho, AM
    Freitas, AT
    Oliveira, AL
    Sagot, MF
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2006, 3 (02) : 126 - 140
  • [48] An efficient parallel and distributed algorithm for counting frequent sets
    Orlando, S
    Palmerini, P
    Perego, R
    Silvestri, F
    HIGH PERFORMANCE COMPUTING FOR COMPUTATIONAL SCIENCE - VECPAR 2002, 2003, 2565 : 421 - 435
  • [49] A Memory Efficient Algorithm for Real Time Object Counting
    Subramanian, S.
    Bhadrinarayana, L. V.
    2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3, 2009, : 245 - 248
  • [50] An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem
    Chakaravarthy, Venkatesan T.
    Choudhury, Anamitra R.
    Garg, Vijay K.
    Sabharwal, Yogish
    DISTRIBUTED COMPUTING AND NETWORKING, 2011, 6522 : 53 - +
12345