Identification of large disjoint motifs in biological networks.

ABSTRACT:

Background

Biological networks provide great potential to understand how cells function. Network motifs, frequent topological patterns, are key structures through which biological networks operate. Finding motifs in biological networks remains to be computationally challenging task as the size of the motif and the underlying network grow. Often, different copies of a given motif topology in a network share nodes or edges. Counting such overlapping copies introduces significant problems in motif identification.

Results

In this paper, we develop a scalable algorithm for finding network motifs. Unlike most of the existing studies, our algorithm counts independent copies of each motif topology. We introduce a set of small patterns and prove that we can construct any larger patte

SUBMITTER: Elhesha R 

PROVIDER: S-EPMC5053092 | biostudies-literature | 2016 Oct

REPOSITORIES: biostudies-literature