Cargando…
Network Completion for Static Gene Expression Data
We tackle the problem of completing and inferring genetic networks under stationary conditions from static data, where network completion is to make the minimum amount of modifications to an initial network so that the completed network is most consistent with the expression data in which addition o...
Autores principales: | Nakajima, Natsu, Akutsu, Tatsuya |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3984774/ https://www.ncbi.nlm.nih.gov/pubmed/24826192 http://dx.doi.org/10.1155/2014/382452 |
Ejemplares similares
-
Exact and Heuristic Methods for Network Completion for Time-Varying Genetic Networks
por: Nakajima, Natsu, et al.
Publicado: (2014) -
Network Completion Using Dynamic Programming and Least-Squares Fitting
por: Nakajima, Natsu, et al.
Publicado: (2012) -
Codependency and mutual exclusivity for gene community detection from sparse single-cell transcriptome data
por: Nakajima, Natsu, et al.
Publicado: (2021) -
Determining the minimum number of protein-protein interactions required to support known protein complexes
por: Nakajima, Natsu, et al.
Publicado: (2018) -
Epidemiologically Optimal Static Networks from Temporal Network Data
por: Holme, Petter
Publicado: (2013)