Description Usage Arguments Details Value Note Author(s) References
Internal function for pc-NEM for inference of graph structure and noise paramters (optional) using adaptive simulated annealing. The code for adaptive simulated annealing has been developed using the code from the paper titled 'Partition MCMC for Inference on Acyclic Digraphs' by Jack Kuipers & Giusi Moffa which is further based on the code from the Dortmund course programmed by Miriam Lohr. The code has been modified to match it to the NEMs framework. The scoring function has been changed to compute the likelihood according to our model. Further, the update steps have been modified.
1 |
n |
Number of S-genes |
phi |
The starting S-gene model |
|
The data set. The rows refer to the E-genes and the columns correspond to the knockdown experiment. |
control |
Control parameters set using set.default.parameters. Object stores the information on number of iterations, temperature, adaptation rate, ideal acceptance rate, perturbation map and option to infer noise parameters. |
The algorithm stochastically alternates between two distinct spaces, one for the graphs and one for the error rates.
graphs |
Graph chain |
LLscores |
Log-likelihood score chain |
Temp |
Temperature chain |
AcceptRate |
Acceptance rate chain |
AlphaVals |
False positive rates chain |
BetaVals |
False negative rates chain |
maxLLscore |
Log-likelihood value of best graph |
maxDAG |
DAG with the maximum log-likelihood value |
typeI |
MLE of false positive rate |
typeII |
MLE of false negative rate |
minIter |
Minimum steps taken to reach the maximum log-likeliood value |
transformAR |
Log transformed acceptance rate |
Can be modified for continuous data if needed.
Sumana Srivatsa
Srivatsa S, Kuipers J, Schmich F, Eicher S, Emmenlauer M, Dehio C, Beerenwinkel N, Improved pathway reconstruction from RNA interference screens by exploiting off-target effects, ISMB, 2018
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.