Shortest path counting in probabilistic biological networks.

ABSTRACT:

Background

Biological regulatory networks, representing the interactions between genes and their products, control almost every biological activity in the cell. Shortest path search is critical to apprehend the structure of these networks, and to detect their key components. Counting the number of shortest paths between pairs of genes in biological networks is a polynomial time problem. The fact that biological interactions are uncertain events however drastically complicates the problem, as it makes the topology of a given network uncertain.

Results

In this paper, we develop a novel method to count the number of shortest paths between two nodes in probabilistic networks. Unlike earlier approaches, which uses the shortest path counting methods that are specifically designed

SUBMITTER: Ren Y 

PROVIDER: S-EPMC6278053 | biostudies-literature | 2018 Dec

REPOSITORIES: biostudies-literature