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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2012-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1100/2012/957620 |