Parametric and non-parametric gradient matching for network inference: a comparison
Abstract Background Reverse engineering of gene regulatory networks from time series gene-expression data is a challenging problem, not only because of the vast sets of candidate interactions but also due to the stochastic nature of gene expression. We limit our analysis to nonlinear differential eq...
Main Authors: | Leander Dony, Fei He, Michael P. H. Stumpf |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2019-01-01
|
Series: | BMC Bioinformatics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s12859-018-2590-7 |
Similar Items
-
MatchIt: Nonparametric Preprocessing for Parametric Causal Inference
by: Daniel Ho, et al.
Published: (2011-08-01) -
Applied comparison of large‐scale propensity score matching and cardinality matching for causal inference in observational research
by: Stephen P. Fortin, et al.
Published: (2021-05-01) -
Inference of gene regulation functions from dynamic transcriptome data
by: Patrick Hillenbrand, et al.
Published: (2016-09-01) -
Non-parametric style transfer: Correlation-aware exact distribution matching
by: Jeong-Sik Lee, et al.
Published: (2023-12-01) -
Mathematical model of parametrically controlled matched filters
by: Borislav Georgiev Naydenov, et al.
Published: (2017-12-01)