ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies
Abstract Background Identifying motifs in biological networks is essential in uncovering key functions served by these networks. Finding non-overlapping motif instances is however a computationally challenging task. The fact that biological interactions are uncertain events further complicates the p...
Main Authors: | Yuanfang Ren, Aisharjya Sarkar, Tamer Kahveci |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2018-06-01
|
Series: | BMC Bioinformatics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s12859-018-2236-9 |
Similar Items
-
Efficiently counting complex multilayer temporal motifs in large-scale networks
by: Hanjo D. Boekhout, et al.
Published: (2019-09-01) -
Motifs in Big Networks: Methods and Applications
by: Shuo Yu, et al.
Published: (2019-01-01) -
Shortest path counting in probabilistic biological networks
by: Yuanfang Ren, et al.
Published: (2018-12-01) -
On Symmetry of Independence Polynomials
by: Vadim E. Levit, et al.
Published: (2011-07-01) -
On the values of independence and domination polynomials at specific points
by: Saeid Alikhani, et al.
Published: (2012-06-01)