Cargando…
Shortest path counting in probabilistic biological networks
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...
Autores principales: | Ren, Yuanfang, Ay, Ahmet, Kahveci, Tamer |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6278053/ https://www.ncbi.nlm.nih.gov/pubmed/30514202 http://dx.doi.org/10.1186/s12859-018-2480-z |
Ejemplares similares
-
Characterizing building blocks of resource constrained biological networks
por: Ren, Yuanfang, et al.
Publicado: (2019) -
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017) -
Probabilistic inference and ranking of gene regulatory pathways as a shortest-path problem
por: Jensen, James D, et al.
Publicado: (2013) -
ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies
por: Ren, Yuanfang, et al.
Publicado: (2018) -
Identifying the topology of signaling networks from partial RNAi data
por: Ren, Yuanfang, et al.
Publicado: (2016)