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

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...

Full description

Bibliographic Details
Main Authors: Yuanfang Ren, Aisharjya Sarkar, Tamer Kahveci
Format: Article
Language:English
Published: BMC 2018-06-01
Series:BMC Bioinformatics
Subjects:
Independent motif counting
Probabilistic networks
Polynomial
Online Access:http://link.springer.com/article/10.1186/s12859-018-2236-9

Internet

http://link.springer.com/article/10.1186/s12859-018-2236-9

Similar Items