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: | , , |
---|---|
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 |