Cargando…
Probabilistic inference and ranking of gene regulatory pathways as a shortest-path problem
BACKGROUND: Since the advent of microarray technology, numerous methods have been devised to infer gene regulatory relationships from gene expression data. Many approaches that infer entire regulatory networks. This produces results that are rich in information and yet so complex that they are often...
Autores principales: | Jensen, James D, Jensen, Daniel M, Clement, Mark J, Snell, Quinn O |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3849606/ https://www.ncbi.nlm.nih.gov/pubmed/24266986 http://dx.doi.org/10.1186/1471-2105-14-S13-S5 |
Ejemplares similares
-
Shortest path counting in probabilistic biological networks
por: Ren, Yuanfang, et al.
Publicado: (2018) -
A single source k-shortest paths algorithm to infer regulatory pathways in a gene network
por: Shih, Yu-Keng, et al.
Publicado: (2012) -
Shortest paths for sub-Riemannian metrics on rank-two distributions
por: Liu, Wensheng, et al.
Publicado: (1995) -
On the shortest path problem of uncertain random digraphs
por: Li, Hao, et al.
Publicado: (2022) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
por: Zhang, Xiaoge, et al.
Publicado: (2014)