Shortest path counting in probabilistic biological networks

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

Full description

Bibliographic Details
Main Authors: Yuanfang Ren, Ahmet Ay, Tamer Kahveci
Format: Article
Language:English
Published: BMC 2018-12-01
Series:BMC Bioinformatics
Subjects:
Shortest path
Probabilistic networks
Edge betweenness
Community detection
Online Access:http://link.springer.com/article/10.1186/s12859-018-2480-z

Internet

http://link.springer.com/article/10.1186/s12859-018-2480-z

Similar Items