Debian Codegraph @

src/Marginals.cpp

raw
1 #include "Marginals.h"
2
3
4 /*
5 // calculate marginals from the combos, store in results
6 void marginalGenotypeLikelihoods(list<GenotypeCombo>& genotypeCombos, Results& results) {
7
8
9 map<string, map<Genotype*, vector<long double> > > rawMarginals;
10
11 // push the marginal likelihoods into the rawMarginals vectors in the results
12 for (list<GenotypeCombo>::iterator gc = genotypeCombos.begin(); gc != genotypeCombos.end(); ++gc) {
13 for (GenotypeCombo::const_iterator i = gc->begin(); i != gc->end(); ++i) {
14 const SampleDataLikelihood& sdl = **i;
15 rawMarginals[sdl.name][sdl.genotype].push_back(gc->posteriorProb);
16 }
17 }
18
19 // safely add the raw marginal vectors using logsumexp
20 for (Results::iterator r = results.begin(); r != results.end(); ++r) {
21 ResultData& sample = r->second;
22 map<Genotype*, vector<long double> >& rawmgs = rawMarginals[r->first];
23 vector<long double> probs;
24 for (map<Genotype*, vector<long double> >::iterator m = rawmgs.begin(); m != rawmgs.end(); ++m) {
25 probs.push_back(logsumexp_probs(m->second));
26 }
27 long double normalizer = logsumexp_probs(probs);
28 vector<long double>::iterator p = probs.begin();
29 for (map<Genotype*, vector<long double> >::iterator m = rawmgs.begin(); m != rawmgs.end(); ++m, ++p) {
30 sample.marginals[m->first] = *p - normalizer;
31 }
32 }
33
34 }
35 */
36
37 // recompute data likelihoods using marginals from the combos
38 // assumes that the genotype combos are in the same order as the likelihoods
39 // assumes that the genotype combos are the same size as the number of samples in the likelihoods
40 // returns the delta from the previous marginals, informative in the case of EM
41 long double marginalGenotypeLikelihoods(list<GenotypeCombo>& genotypeCombos, SampleDataLikelihoods& likelihoods) {
42
43 long double delta = 0;
44
45 vector< map<Genotype*, long double> > rawMarginals;
46 rawMarginals.resize(likelihoods.size());
47 vector< map<Genotype*, long double> >::iterator rawMarginalsItr;
48
49 // push the marginal likelihoods into the rawMarginals maps
50 for (list<GenotypeCombo>::iterator gc = genotypeCombos.begin(); gc != genotypeCombos.end(); ++gc) {
51 rawMarginalsItr = rawMarginals.begin();
52 for (GenotypeCombo::const_iterator i = gc->begin(); i != gc->end(); ++i) {
53 const SampleDataLikelihood& sdl = **i;
54 map<Genotype*, long double>& rmgs = *rawMarginalsItr++;
55 map<Genotype*, long double>::iterator rmgsItr = rmgs.find(sdl.genotype);
56 if (rmgsItr == rmgs.end()) {
57 rmgs[sdl.genotype] = gc->posteriorProb;
58 } else {
59 //vector<long double> x;
60 //x.push_back(rmgsItr->second); x.push_back(gc->posteriorProb);
61 //rmgs[sdl.genotype] = logsumexp_probs(x);
62 rmgs[sdl.genotype] = log(safe_exp(rmgsItr->second) + safe_exp(gc->posteriorProb));
63 }
64 }
65 }
66
67 // safely add the raw marginal vectors using logsumexp
68 // and use to update the sample data likelihoods
69 rawMarginalsItr = rawMarginals.begin();
70 long double minAllowedMarginal = -1e-16;
71 for (SampleDataLikelihoods::iterator s = likelihoods.begin(); s != likelihoods.end(); ++s) {
72 vector<SampleDataLikelihood>& sdls = *s;
73 const map<Genotype*, long double>& rawmgs = *rawMarginalsItr++;
74 map<Genotype*, long double> marginals;
75 vector<long double> rawprobs;
76 for (map<Genotype*, long double>::const_iterator m = rawmgs.begin(); m != rawmgs.end(); ++m) {
77 long double p = m->second;
78 marginals[m->first] = p;
79 rawprobs.push_back(p);
80 }
81 long double normalizer = logsumexp_probs(rawprobs);
82 for (vector<SampleDataLikelihood>::iterator sdl = sdls.begin(); sdl != sdls.end(); ++sdl) {
83 long double newmarginal = marginals[sdl->genotype] - normalizer;
84 delta += newmarginal - sdl->marginal;
85 // ensure the marginal is non-0 to guard against underflow
86 sdl->marginal = min(minAllowedMarginal, newmarginal);
87 }
88 }
89
90 return delta;
91
92 }
93
94 /*
95 void bestMarginalGenotypeCombo(GenotypeCombo& combo,
96 Results& results,
97 SampleDataLikelihoods& samples,
98 long double theta,
99 bool pooled,
100 bool permute,
101 bool hwePriors,
102 bool binomialObsPriors,
103 bool alleleBalancePriors,
104 long double diffusionPriorScalar) {
105
106 for (SampleDataLikelihoods::iterator s = samples.begin(); s != samples.end(); ++s) {
107 vector<SampleDataLikelihood>& sdls = *s;
108 const string& name = sdls.front().name;
109 const map<Genotype*, long double>& marginals = results[name].marginals;;
110 map<Genotype*, long double>::const_iterator m = marginals.begin();
111 long double bestMarginalProb = m->second;
112 Genotype* bestMarginalGenotype = m->first;
113 ++m;
114 for (; m != marginals.end(); ++m) {
115 if (abs(m->second) < abs(bestMarginalProb)) {
116 bestMarginalProb = m->second;
117 bestMarginalGenotype = m->first;
118 }
119 }
120 for (vector<SampleDataLikelihood>::iterator d = sdls.begin(); d != sdls.end(); ++d) {
121 if (bestMarginalGenotype == d->genotype) {
122 combo.push_back(&*d);
123 break;
124 }
125 }
126 }
127
128 combo.init(binomialObsPriors);
129 combo.calculatePosteriorProbability(theta, pooled, permute, hwePriors, binomialObsPriors,
130 alleleBalancePriors, diffusionPriorScalar);
131
132 }
133 */
134
135 long double balancedMarginalGenotypeLikelihoods(list<GenotypeCombo>& genotypeCombos, SampleDataLikelihoods& likelihoods) {
136
137 long double delta = 0;
138
139 //map<string, map<Genotype*, vector<long double> > > rawMarginals;
140 vector< map<Genotype*, vector<long double> > > rawMarginals;
141 rawMarginals.resize(likelihoods.size());
142 vector< map<Genotype*, vector<long double> > >::iterator rawMarginalsItr;
143
144 // push the marginal likelihoods into the rawMarginals maps
145 for (list<GenotypeCombo>::iterator gc = genotypeCombos.begin(); gc != genotypeCombos.end(); ++gc) {
146 if (gc->isHomozygous()) {
147 rawMarginalsItr = rawMarginals.begin();
148 for (GenotypeCombo::const_iterator i = gc->begin(); i != gc->end(); ++i) {
149 const SampleDataLikelihood& sdl = **i;
150 map<Genotype*, vector<long double> >& rmgs = *rawMarginalsItr++;
151 rmgs[sdl.genotype].push_back(gc->posteriorProb);
152 }
153 } else {
154 bool isComboKing = true;
155 rawMarginalsItr = rawMarginals.begin();
156 for (GenotypeCombo::const_iterator i = gc->begin(); i != gc->end(); ++i) {
157 const SampleDataLikelihood& sdl = **i;
158 if (sdl.rank != 0) {
159 isComboKing = false;
160 map<Genotype*, vector<long double> >& rmgs = *rawMarginalsItr;
161 rmgs[sdl.genotype].push_back(gc->posteriorProb);
162 }
163 ++rawMarginalsItr;
164 }
165 if (isComboKing) {
166 rawMarginalsItr = rawMarginals.begin();
167 for (GenotypeCombo::const_iterator i = gc->begin(); i != gc->end(); ++i) {
168 const SampleDataLikelihood& sdl = **i;
169 map<Genotype*, vector<long double> >& rmgs = *rawMarginalsItr++;
170 rmgs[sdl.genotype].push_back(gc->posteriorProb);
171 }
172 }
173 }
174 }
175
176 // safely add the raw marginal vectors using logsumexp
177 rawMarginalsItr = rawMarginals.begin();
178 for (SampleDataLikelihoods::iterator s = likelihoods.begin(); s != likelihoods.end(); ++s) {
179 vector<SampleDataLikelihood>& sdls = *s;
180 const map<Genotype*, vector<long double> >& rawmgs = *rawMarginalsItr++;
181 map<Genotype*, long double> marginals;
182 vector<long double> rawprobs;
183 for (map<Genotype*, vector<long double> >::const_iterator m = rawmgs.begin(); m != rawmgs.end(); ++m) {
184 long double p = logsumexp_probs(m->second);
185 marginals[m->first] = p;
186 rawprobs.push_back(p);
187 }
188 long double normalizer = logsumexp_probs(rawprobs);
189 for (vector<SampleDataLikelihood>::iterator sdl = sdls.begin(); sdl != sdls.end(); ++sdl) {
190 long double newmarginal = marginals[sdl->genotype] - normalizer;
191 delta += newmarginal - sdl->marginal;
192 sdl->marginal = newmarginal;
193 }
194 }
195
196 return delta;
197
198 }