Eval probability for M step Computes the log directly as log density is faster to compute
1 | eval.fik.m(Schrod, centers, weights, adj.factor, log = TRUE)
|
Schrod |
The shcrodinger list of matrices |
centers |
centers of the clusters |
weights |
weight of each cluster |
adj.factor |
The adjusting factor, taking into account contamination, copy number, number of copies |
log |
Should it compute the log distribution (TRUE) or probability (FALSE) between two optimization steps. If NULL, will take 1/(median depth). |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.