Network Completion Using Dynamic Programming and Least-Squares Fitting

We consider the problem of network completion, which is to make the minimum amount of modifications to a given network so that the resulting network is most consistent with the observed data. We employ here a certain type of differential equations as gene regulation rules in a genetic network, gene...

Descripción completa

Detalles Bibliográficos
Autores principales: Nakajima, Natsu, Tamura, Takeyuki, Yamanishi, Yoshihiro, Horimoto, Katsuhisa, Akutsu, Tatsuya
Formato: Online Artículo Texto
Lenguaje:English
Publicado: The Scientific World Journal 2012
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3504398/
https://www.ncbi.nlm.nih.gov/pubmed/23213307
http://dx.doi.org/10.1100/2012/957620

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3504398/
https://www.ncbi.nlm.nih.gov/pubmed/23213307
http://dx.doi.org/10.1100/2012/957620

Ejemplares similares