1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
|
/*
* phylokernelnonrev.cpp
* likelihood kernel for non-reversible models
*
* Created on: Mar 30, 2016
* Author: minh
*/
#include "phylotree.h"
#include "phylokernelnew.h"
#include "vectorclass/vectorf64.h"
void PhyloTree::computeNonrevPartialLikelihood(TraversalInfo &info, size_t ptn_lower, size_t ptn_upper, int thread_id) {
PhyloNeighbor *dad_branch = info.dad_branch;
PhyloNode *dad = info.dad;
// don't recompute the likelihood
ASSERT(dad);
// if (dad_branch->partial_lh_computed & 1)
// return;
// dad_branch->partial_lh_computed |= 1;
PhyloNode *node = (PhyloNode*)(dad_branch->node);
ASSERT(dad_branch->direction != UNDEFINED_DIRECTION);
size_t nstates = aln->num_states;
// size_t nptn = aln->size()+model_factory->unobserved_ptns.size();
if (node->isLeaf()) {
// dad_branch->lh_scale_factor = 0.0;
// if (!tip_partial_lh_computed)
// computeTipPartialLikelihood();
return;
}
ASSERT(node->degree() >= 3);
size_t ptn, c;
size_t orig_ntn = aln->size();
size_t ncat = site_rate->getNRate();
// const size_t nstatesqr=nstates*nstates;
size_t i, x;
size_t block = nstates * ncat;
// dad_branch->lh_scale_factor = 0.0;
// internal node
PhyloNeighbor *left = NULL, *right = NULL; // left & right are two neighbors leading to 2 subtrees
FOR_NEIGHBOR_IT(node, dad, it) {
// PhyloNeighbor *nei = (PhyloNeighbor*)*it;
if (!left) left = (PhyloNeighbor*)(*it); else right = (PhyloNeighbor*)(*it);
// if ((nei->partial_lh_computed & 1) == 0)
// computeNonrevPartialLikelihood(nei, node);
// dad_branch->lh_scale_factor += nei->lh_scale_factor;
}
// if (params->lh_mem_save == LM_PER_NODE && !dad_branch->partial_lh) {
// // re-orient partial_lh
// bool done = false;
// FOR_NEIGHBOR_IT(node, dad, it2) {
// PhyloNeighbor *backnei = ((PhyloNeighbor*)(*it2)->node->findNeighbor(node));
// if (backnei->partial_lh) {
// dad_branch->partial_lh = backnei->partial_lh;
// dad_branch->scale_num = backnei->scale_num;
// backnei->partial_lh = NULL;
// backnei->scale_num = NULL;
// backnei->partial_lh_computed &= ~1; // clear bit
// done = true;
// break;
// }
// }
// assert(done && "partial_lh is not re-oriented");
// }
// precompute buffer to save times
// double *echildren = new double[block*nstates*(node->degree()-1)];
// double *partial_lh_leaves = new double[(aln->STATE_UNKNOWN+1)*block*(node->degree()-1)];
// double *echild = echildren;
// double *partial_lh_leaf = partial_lh_leaves;
double *echildren = info.echildren;
double *partial_lh_leaves = info.partial_lh_leaves;
// double sum_scale = 0.0;
double *eleft = echildren, *eright = echildren + block*nstates;
if ((!left->node->isLeaf() && right->node->isLeaf())) {
PhyloNeighbor *tmp = left;
left = right;
right = tmp;
double *etmp = eleft;
eleft = eright;
eright = etmp;
}
if (node->degree() > 3) {
/*--------------------- multifurcating node ------------------*/
// now for-loop computing partial_lh over all site-patterns
//#ifdef _OPENMP
//#pragma omp parallel for reduction(+: sum_scale) private(ptn, c, x, i) schedule(static)
//#endif
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double *partial_lh_all = dad_branch->partial_lh + ptn*block;
for (i = 0; i < block; i++)
partial_lh_all[i] = 1.0;
dad_branch->scale_num[ptn] = 0;
double *partial_lh_leaf = partial_lh_leaves;
double *echild = echildren;
FOR_NEIGHBOR_IT(node, dad, it) {
PhyloNeighbor *child = (PhyloNeighbor*)*it;
if (child->node->isLeaf()) {
// external node
int state_child;
if (child->node == root)
state_child = 0;
else state_child = (ptn < orig_ntn) ? (aln->at(ptn))[child->node->id] : model_factory->unobserved_ptns[ptn-orig_ntn];
double *child_lh = partial_lh_leaf + state_child*block;
for (c = 0; c < block; c++) {
// compute real partial likelihood vector
partial_lh_all[c] *= child_lh[c];
}
partial_lh_leaf += (aln->STATE_UNKNOWN+1)*block;
} else {
// internal node
double *partial_lh = partial_lh_all;
double *partial_lh_child = child->partial_lh + ptn*block;
dad_branch->scale_num[ptn] += child->scale_num[ptn];
double *echild_ptr = echild;
for (c = 0; c < ncat; c++) {
// compute real partial likelihood vector
for (x = 0; x < nstates; x++) {
double vchild = 0.0;
for (i = 0; i < nstates; i++) {
vchild += echild_ptr[i] * partial_lh_child[i];
}
echild_ptr += nstates;
partial_lh[x] *= vchild;
}
partial_lh += nstates;
partial_lh_child += nstates;
}
} // if
echild += block*nstates;
} // FOR_NEIGHBOR
double lh_max = partial_lh_all[0];
for (i = 1; i < block; i++)
lh_max = max(lh_max, partial_lh_all[i]);
ASSERT(lh_max > 0.0);
// check if one should scale partial likelihoods
if (lh_max == 0.0) {
// for very shitty data
for (c = 0; c < ncat; c++)
memcpy(&partial_lh_all[c*nstates], &tip_partial_lh[aln->STATE_UNKNOWN*nstates], nstates*sizeof(double));
// sum_scale += LOG_SCALING_THRESHOLD* 4 * ptn_freq[ptn];
//sum_scale += log(lh_max) * ptn_freq[ptn];
dad_branch->scale_num[ptn] += 4;
// int nsite = aln->getNSite();
// for (i = 0, x = 0; i < nsite && x < ptn_freq[ptn]; i++)
// if (aln->getPatternID(i) == ptn) {
// outWarning((string)"Numerical underflow for site " + convertIntToString(i+1));
// x++;
// }
} else if (lh_max < SCALING_THRESHOLD) {
// now do the likelihood scaling
for (i = 0; i < block; i++) {
partial_lh_all[i] *= SCALING_THRESHOLD_INVER;
//partial_lh[i] /= lh_max;
}
// unobserved const pattern will never have underflow
// sum_scale += LOG_SCALING_THRESHOLD * ptn_freq[ptn];
//sum_scale += log(lh_max) * ptn_freq[ptn];
dad_branch->scale_num[ptn] += 1;
}
} // for ptn
// dad_branch->lh_scale_factor += sum_scale;
// end multifurcating treatment
} else if (left->node->isLeaf() && right->node->isLeaf()) {
/*--------------------- TIP-TIP (cherry) case ------------------*/
double *partial_lh_left = partial_lh_leaves;
double *partial_lh_right = partial_lh_leaves + (aln->STATE_UNKNOWN+1)*block;
if (right->node == root) {
// swap so that left node is the root
PhyloNeighbor *tmp = left;
left = right;
right = tmp;
double *etmp = eleft;
eleft = eright;
eright = etmp;
etmp = partial_lh_left;
partial_lh_left = partial_lh_right;
partial_lh_right = etmp;
}
// scale number must be ZERO
memset(dad_branch->scale_num + ptn_lower, 0, (ptn_upper-ptn_lower) * sizeof(UBYTE));
//#ifdef _OPENMP
//#pragma omp parallel for private(ptn, i) schedule(static)
//#endif
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double *partial_lh = dad_branch->partial_lh + ptn*block;
int state_left;
if (left->node == root)
state_left = 0;
else
state_left = (ptn < orig_ntn) ? (aln->at(ptn))[left->node->id] : model_factory->unobserved_ptns[ptn-orig_ntn];
int state_right = (ptn < orig_ntn) ? (aln->at(ptn))[right->node->id] : model_factory->unobserved_ptns[ptn-orig_ntn];
double *vleft = partial_lh_left + (state_left*block);
double *vright = partial_lh_right + (state_right*block);
for (i = 0; i < block; i++)
partial_lh[i] = vleft[i] * vright[i];
}
} else if (left->node->isLeaf() && !right->node->isLeaf()) {
/*--------------------- TIP-INTERNAL NODE case ------------------*/
// only take scale_num from the right subtree
memcpy(dad_branch->scale_num + ptn_lower, right->scale_num + ptn_lower, (ptn_upper-ptn_lower) * sizeof(UBYTE));
double *partial_lh_left = partial_lh_leaves;
//#ifdef _OPENMP
//#pragma omp parallel for reduction(+: sum_scale) private(ptn, c, x, i) schedule(static)
//#endif
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double *partial_lh = dad_branch->partial_lh + ptn*block;
double *partial_lh_right = right->partial_lh + ptn*block;
int state_left;
if (left->node == root)
state_left = 0;
else
state_left = (ptn < orig_ntn) ? (aln->at(ptn))[left->node->id] : model_factory->unobserved_ptns[ptn-orig_ntn];
double *vleft = partial_lh_left + state_left*block;
double lh_max = 0.0;
double *eright_ptr = eright;
for (c = 0; c < ncat; c++) {
// compute real partial likelihood vector
for (x = 0; x < nstates; x++) {
double vright = 0.0;
for (i = 0; i < nstates; i++) {
vright += eright_ptr[i] * partial_lh_right[i];
}
eright_ptr += nstates;
lh_max = max(lh_max, (partial_lh[c*nstates+x] = vleft[x]*vright));
}
vleft += nstates;
partial_lh_right += nstates;
}
ASSERT(lh_max > 0.0);
// check if one should scale partial likelihoods
if (lh_max == 0.0) {
// for very shitty data
for (c = 0; c < ncat; c++)
memcpy(&partial_lh[c*nstates], &tip_partial_lh[aln->STATE_UNKNOWN*nstates], nstates*sizeof(double));
// sum_scale += LOG_SCALING_THRESHOLD* 4 * ptn_freq[ptn];
//sum_scale += log(lh_max) * ptn_freq[ptn];
dad_branch->scale_num[ptn] += 4;
// int nsite = aln->getNSite();
// for (i = 0, x = 0; i < nsite && x < ptn_freq[ptn]; i++)
// if (aln->getPatternID(i) == ptn) {
// outWarning((string)"Numerical underflow for site " + convertIntToString(i+1));
// x++;
// }
} else if (lh_max < SCALING_THRESHOLD) {
// now do the likelihood scaling
for (i = 0; i < block; i++) {
partial_lh[i] *= SCALING_THRESHOLD_INVER;
//partial_lh[i] /= lh_max;
}
// unobserved const pattern will never have underflow
// sum_scale += LOG_SCALING_THRESHOLD * ptn_freq[ptn];
//sum_scale += log(lh_max) * ptn_freq[ptn];
dad_branch->scale_num[ptn] += 1;
}
}
// dad_branch->lh_scale_factor += sum_scale;
// delete [] partial_lh_left;
} else {
/*--------------------- INTERNAL-INTERNAL NODE case ------------------*/
//#ifdef _OPENMP
//#pragma omp parallel for reduction(+: sum_scale) private(ptn, c, x, i) schedule(static)
//#endif
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double *partial_lh = dad_branch->partial_lh + ptn*block;
double *partial_lh_left = left->partial_lh + ptn*block;
double *partial_lh_right = right->partial_lh + ptn*block;
double lh_max = 0.0;
dad_branch->scale_num[ptn] = left->scale_num[ptn] + right->scale_num[ptn];
double *eleft_ptr = eleft;
double *eright_ptr = eright;
for (c = 0; c < ncat; c++) {
// compute real partial likelihood vector
for (x = 0; x < nstates; x++) {
double vleft = 0.0, vright = 0.0;
for (i = 0; i < nstates; i++) {
vleft += eleft_ptr[i] * partial_lh_left[i];
vright += eright_ptr[i] * partial_lh_right[i];
}
eleft_ptr += nstates;
eright_ptr += nstates;
lh_max=max(lh_max, (partial_lh[c*nstates+x] = vleft*vright));
}
partial_lh_left += nstates;
partial_lh_right += nstates;
}
ASSERT(lh_max > 0.0);
// check if one should scale partial likelihoods
if (lh_max == 0.0) {
// for very shitty data
for (c = 0; c < ncat; c++)
memcpy(&partial_lh[c*nstates], &tip_partial_lh[aln->STATE_UNKNOWN*nstates], nstates*sizeof(double));
// sum_scale += LOG_SCALING_THRESHOLD* 4 * ptn_freq[ptn];
//sum_scale += log(lh_max) * ptn_freq[ptn];
dad_branch->scale_num[ptn] += 4;
// int nsite = aln->getNSite();
// for (i = 0, x = 0; i < nsite && x < ptn_freq[ptn]; i++)
// if (aln->getPatternID(i) == ptn) {
// outWarning((string)"Numerical underflow for site " + convertIntToString(i+1));
// x++;
// }
} else if (lh_max < SCALING_THRESHOLD) {
// now do the likelihood scaling
for (i = 0; i < block; i++) {
partial_lh[i] *= SCALING_THRESHOLD_INVER;
//partial_lh[i] /= lh_max;
}
// unobserved const pattern will never have underflow
// sum_scale += LOG_SCALING_THRESHOLD * ptn_freq[ptn];
//sum_scale += log(lh_max) * ptn_freq[ptn];
dad_branch->scale_num[ptn] += 1;
}
}
// dad_branch->lh_scale_factor += sum_scale;
}
// delete [] partial_lh_leaves;
// delete [] echildren;
}
//template <const int nstates>
void PhyloTree::computeNonrevLikelihoodDerv(PhyloNeighbor *dad_branch, PhyloNode *dad, double *df, double *ddf) {
ASSERT(rooted);
PhyloNode *node = (PhyloNode*) dad_branch->node;
PhyloNeighbor *node_branch = (PhyloNeighbor*) node->findNeighbor(dad);
if (!central_partial_lh)
initializeAllPartialLh();
if (node->isLeaf() || (dad_branch->direction == AWAYFROM_ROOT && dad != root)) {
PhyloNode *tmp_node = dad;
dad = node;
node = tmp_node;
PhyloNeighbor *tmp_nei = dad_branch;
dad_branch = node_branch;
node_branch = tmp_nei;
}
computeTraversalInfo<Vec1d>(node, dad, false);
// if ((dad_branch->partial_lh_computed & 1) == 0)
// computeNonrevPartialLikelihood(dad_branch, dad);
// if ((node_branch->partial_lh_computed & 1) == 0)
// computeNonrevPartialLikelihood(node_branch, node);
size_t nstates = aln->num_states;
size_t nstatesqr = nstates*nstates;
size_t ncat = site_rate->getNRate();
size_t block = ncat * nstates;
size_t ptn; // for big data size > 4GB memory required
size_t c, i, x;
size_t orig_nptn = aln->size();
size_t nptn = aln->size()+model_factory->unobserved_ptns.size();
double *trans_mat = new double[block*nstates*3];
double *trans_derv1 = trans_mat + block*nstates;
double *trans_derv2 = trans_derv1 + block*nstates;
for (c = 0; c < ncat; c++) {
double len = site_rate->getRate(c)*dad_branch->length;
double prop = site_rate->getProp(c);
double *this_trans_mat = &trans_mat[c*nstatesqr];
double *this_trans_derv1 = &trans_derv1[c*nstatesqr];
double *this_trans_derv2 = &trans_derv2[c*nstatesqr];
model->computeTransDerv(len, this_trans_mat, this_trans_derv1, this_trans_derv2);
double prop_rate = prop*site_rate->getRate(c);
double prop_rate_2 = prop_rate * site_rate->getRate(c);
for (i = 0; i < nstatesqr; i++) {
this_trans_mat[i] *= prop;
this_trans_derv1[i] *= prop_rate;
this_trans_derv2[i] *= prop_rate_2;
}
}
double my_df = 0.0, my_ddf = 0.0, prob_const = 0.0, df_const = 0.0, ddf_const = 0.0;
vector<size_t> limits;
computeBounds<Vec1d>(num_threads, nptn, limits);
if (dad->isLeaf()) {
// make sure that we do not estimate the virtual branch length from the root
ASSERT(dad != root);
// special treatment for TIP-INTERNAL NODE case
double *partial_lh_node = new double[(aln->STATE_UNKNOWN+1)*block*3];
double *partial_lh_derv1 = partial_lh_node + (aln->STATE_UNKNOWN+1)*block;
double *partial_lh_derv2 = partial_lh_derv1 + (aln->STATE_UNKNOWN+1)*block;
IntVector states_dad = aln->seq_states[dad->id];
states_dad.push_back(aln->STATE_UNKNOWN);
// precompute information from one tip
for (IntVector::iterator it = states_dad.begin(); it != states_dad.end(); it++) {
double *lh_node = partial_lh_node +(*it)*block;
double *lh_derv1 = partial_lh_derv1 +(*it)*block;
double *lh_derv2 = partial_lh_derv2 +(*it)*block;
double *lh_tip = tip_partial_lh + (*it)*nstates;
double *trans_mat_tmp = trans_mat;
double *trans_derv1_tmp = trans_derv1;
double *trans_derv2_tmp = trans_derv2;
for (c = 0; c < ncat; c++) {
for (i = 0; i < nstates; i++) {
lh_node[i] = 0.0;
lh_derv1[i] = 0.0;
lh_derv2[i] = 0.0;
for (x = 0; x < nstates; x++) {
lh_node[i] += trans_mat_tmp[x] * lh_tip[x];
lh_derv1[i] += trans_derv1_tmp[x] * lh_tip[x];
lh_derv2[i] += trans_derv2_tmp[x] * lh_tip[x];
}
trans_mat_tmp += nstates;
trans_derv1_tmp += nstates;
trans_derv2_tmp += nstates;
}
lh_node += nstates;
lh_derv1 += nstates;
lh_derv2 += nstates;
}
}
// now do the real computation
#ifdef _OPENMP
#pragma omp parallel for reduction(+: my_df, my_ddf, prob_const, df_const, ddf_const) private(ptn, i, c) schedule(static,1) num_threads(num_threads)
#endif
for (int thread_id = 0; thread_id < num_threads; thread_id++) {
size_t ptn_lower = limits[thread_id];
size_t ptn_upper = limits[thread_id+1];
// first compute partial_lh
for (vector<TraversalInfo>::iterator it = traversal_info.begin(); it != traversal_info.end(); it++)
computePartialLikelihood(*it, ptn_lower, ptn_upper, thread_id);
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double lh_ptn = ptn_invar[ptn], df_ptn = 0.0, ddf_ptn = 0.0;
double *partial_lh_dad = dad_branch->partial_lh + ptn*block;
int state_dad;
state_dad = (ptn < orig_nptn) ? (aln->at(ptn))[dad->id] : model_factory->unobserved_ptns[ptn-orig_nptn];
double *lh_node = partial_lh_node + state_dad*block;
double *lh_derv1 = partial_lh_derv1 + state_dad*block;
double *lh_derv2 = partial_lh_derv2 + state_dad*block;
for (c = 0; c < ncat; c++) {
for (i = 0; i < nstates; i++) {
lh_ptn += lh_node[i] * partial_lh_dad[i];
df_ptn += lh_derv1[i] * partial_lh_dad[i];
ddf_ptn += lh_derv2[i] * partial_lh_dad[i];
}
lh_node += nstates;
lh_derv1 += nstates;
lh_derv2 += nstates;
partial_lh_dad += nstates;
}
ASSERT(lh_ptn > 0.0);
if (ptn < orig_nptn) {
double df_frac = df_ptn / lh_ptn;
double ddf_frac = ddf_ptn / lh_ptn;
double freq = ptn_freq[ptn];
double tmp1 = df_frac * freq;
double tmp2 = ddf_frac * freq;
my_df += tmp1;
my_ddf += tmp2 - tmp1 * df_frac;
} else {
// bugfix 2016-01-21, prob_const can be rescaled
if (dad_branch->scale_num[ptn] + node_branch->scale_num[ptn] >= 1)
lh_ptn *= SCALING_THRESHOLD;
// _pattern_lh[ptn] = lh_ptn;
prob_const += lh_ptn;
df_const += df_ptn;
ddf_const += ddf_ptn;
}
} // FOR ptn
} // FOR thread_id
delete [] partial_lh_node;
} else {
// both dad and node are internal nodes
#ifdef _OPENMP
#pragma omp parallel for reduction(+: my_df, my_ddf, prob_const, df_const, ddf_const) private(ptn, i, c, x) schedule(static,1) num_threads(num_threads)
#endif
for (int thread_id = 0; thread_id < num_threads; thread_id++) {
size_t ptn_lower = limits[thread_id];
size_t ptn_upper = limits[thread_id+1];
// first compute partial_lh
for (vector<TraversalInfo>::iterator it = traversal_info.begin(); it != traversal_info.end(); it++)
computePartialLikelihood(*it, ptn_lower, ptn_upper, thread_id);
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double lh_ptn = ptn_invar[ptn], df_ptn = 0.0, ddf_ptn = 0.0;
double *partial_lh_dad = dad_branch->partial_lh + ptn*block;
double *partial_lh_node = node_branch->partial_lh + ptn*block;
double *trans_mat_tmp = trans_mat;
double *trans_derv1_tmp = trans_derv1;
double *trans_derv2_tmp = trans_derv2;
for (c = 0; c < ncat; c++) {
for (i = 0; i < nstates; i++) {
double lh_state = 0.0;
double lh_derv1 = 0.0;
double lh_derv2 = 0.0;
for (x = 0; x < nstates; x++) {
lh_state += trans_mat_tmp[x] * partial_lh_node[x];
lh_derv1 += trans_derv1_tmp[x] * partial_lh_node[x];
lh_derv2 += trans_derv2_tmp[x] * partial_lh_node[x];
}
lh_ptn += partial_lh_dad[i] * lh_state;
df_ptn += partial_lh_dad[i] * lh_derv1;
ddf_ptn += partial_lh_dad[i] * lh_derv2;
trans_mat_tmp += nstates;
trans_derv1_tmp += nstates;
trans_derv2_tmp += nstates;
}
partial_lh_node += nstates;
partial_lh_dad += nstates;
}
ASSERT(lh_ptn > 0.0);
if (ptn < orig_nptn) {
double df_frac = df_ptn / lh_ptn;
double ddf_frac = ddf_ptn / lh_ptn;
double freq = ptn_freq[ptn];
double tmp1 = df_frac * freq;
double tmp2 = ddf_frac * freq;
my_df += tmp1;
my_ddf += tmp2 - tmp1 * df_frac;
} else {
// bugfix 2016-01-21, prob_const can be rescaled
if (dad_branch->scale_num[ptn] + node_branch->scale_num[ptn] >= 1)
lh_ptn *= SCALING_THRESHOLD;
// _pattern_lh[ptn] = lh_ptn;
prob_const += lh_ptn;
df_const += df_ptn;
ddf_const += ddf_ptn;
}
} // FOR ptn
} // FOR thread
}
*df = my_df;
*ddf = my_ddf;
ASSERT(!std::isnan(*df) && !std::isinf(*df));
if (orig_nptn < nptn) {
// ascertainment bias correction
prob_const = 1.0 - prob_const;
double df_frac = df_const / prob_const;
double ddf_frac = ddf_const / prob_const;
int nsites = aln->getNSite();
*df += nsites * df_frac;
*ddf += nsites *(ddf_frac + df_frac*df_frac);
}
delete [] trans_mat;
}
//template <const int nstates>
double PhyloTree::computeNonrevLikelihoodBranch(PhyloNeighbor *dad_branch, PhyloNode *dad) {
ASSERT(rooted);
PhyloNode *node = (PhyloNode*) dad_branch->node;
PhyloNeighbor *node_branch = (PhyloNeighbor*) node->findNeighbor(dad);
if (!central_partial_lh)
initializeAllPartialLh();
if (node->isLeaf() || (dad_branch->direction == AWAYFROM_ROOT && dad != root)) {
PhyloNode *tmp_node = dad;
dad = node;
node = tmp_node;
PhyloNeighbor *tmp_nei = dad_branch;
dad_branch = node_branch;
node_branch = tmp_nei;
}
computeTraversalInfo<Vec1d>(node, dad, false);
// if ((dad_branch->partial_lh_computed & 1) == 0)
// computeNonrevPartialLikelihood(dad_branch, dad);
// if ((node_branch->partial_lh_computed & 1) == 0)
// computeNonrevPartialLikelihood(node_branch, node);
// double tree_lh = node_branch->lh_scale_factor + dad_branch->lh_scale_factor;
double tree_lh = 0.0;
size_t nstates = aln->num_states;
size_t nstatesqr = nstates*nstates;
size_t ncat = site_rate->getNRate();
size_t block = ncat * nstates;
size_t ptn; // for big data size > 4GB memory required
size_t c, i, x;
size_t orig_nptn = aln->size();
size_t nptn = aln->size()+model_factory->unobserved_ptns.size();
vector<size_t> limits;
computeBounds<Vec1d>(num_threads, nptn, limits);
double *trans_mat = new double[block*nstates];
for (c = 0; c < ncat; c++) {
double len = site_rate->getRate(c)*dad_branch->length;
double prop = site_rate->getProp(c);
double *this_trans_mat = &trans_mat[c*nstatesqr];
model->computeTransMatrix(len, this_trans_mat);
for (i = 0; i < nstatesqr; i++)
this_trans_mat[i] *= prop;
}
double prob_const = 0.0;
if (dad->isLeaf()) {
// special treatment for TIP-INTERNAL NODE case
double *partial_lh_node = new double[(aln->STATE_UNKNOWN+1)*block];
if (dad == root) {
for (c = 0; c < ncat; c++) {
double *lh_node = partial_lh_node + c*nstates;
model->getStateFrequency(lh_node);
double prop = site_rate->getProp(c);
for (i = 0; i < nstates; i++)
lh_node[i] *= prop;
}
} else {
IntVector states_dad = aln->seq_states[dad->id];
states_dad.push_back(aln->STATE_UNKNOWN);
// precompute information from one tip
for (IntVector::iterator it = states_dad.begin(); it != states_dad.end(); it++) {
double *lh_node = partial_lh_node +(*it)*block;
double *lh_tip = tip_partial_lh + (*it)*nstates;
double *trans_mat_tmp = trans_mat;
for (c = 0; c < ncat; c++) {
for (i = 0; i < nstates; i++) {
lh_node[i] = 0.0;
for (x = 0; x < nstates; x++)
lh_node[i] += trans_mat_tmp[x] * lh_tip[x];
trans_mat_tmp += nstates;
}
lh_node += nstates;
}
}
}
// now do the real computation
#ifdef _OPENMP
#pragma omp parallel for reduction(+: tree_lh, prob_const) private(ptn, i, c) schedule(static,1) num_threads(num_threads)
#endif
for (int thread_id = 0; thread_id < num_threads; thread_id++) {
size_t ptn_lower = limits[thread_id];
size_t ptn_upper = limits[thread_id+1];
// first compute partial_lh
for (vector<TraversalInfo>::iterator it = traversal_info.begin(); it != traversal_info.end(); it++)
computePartialLikelihood(*it, ptn_lower, ptn_upper, thread_id);
// reset memory for _pattern_lh_cat
memset(_pattern_lh_cat+ptn_lower*ncat, 0, (ptn_upper-ptn_lower)*ncat*sizeof(double));
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double lh_ptn = ptn_invar[ptn];
double *lh_cat = _pattern_lh_cat + ptn*ncat;
double *partial_lh_dad = dad_branch->partial_lh + ptn*block;
int state_dad;
if (dad == root)
state_dad = 0;
else
state_dad = (ptn < orig_nptn) ? (aln->at(ptn))[dad->id] : model_factory->unobserved_ptns[ptn-orig_nptn];
double *lh_node = partial_lh_node + state_dad*block;
for (c = 0; c < ncat; c++) {
for (i = 0; i < nstates; i++) {
lh_cat[c] += lh_node[i] * partial_lh_dad[i];
}
lh_node += nstates;
partial_lh_dad += nstates;
lh_ptn += lh_cat[c];
// lh_cat++;
}
ASSERT(lh_ptn > 0.0);
if (ptn < orig_nptn) {
lh_ptn = log(fabs(lh_ptn)) + dad_branch->scale_num[ptn] * LOG_SCALING_THRESHOLD;
_pattern_lh[ptn] = lh_ptn;
tree_lh += lh_ptn * ptn_freq[ptn];
} else {
// bugfix 2016-01-21, prob_const can be rescaled
if (dad_branch->scale_num[ptn] >= 1)
lh_ptn *= SCALING_THRESHOLD;
// _pattern_lh[ptn] = lh_ptn;
prob_const += lh_ptn;
}
} // FOR ptn
} // FOR thread_id
delete [] partial_lh_node;
} else {
// both dad and node are internal nodes
#ifdef _OPENMP
#pragma omp parallel for reduction(+: tree_lh, prob_const) private(ptn, i, c, x) schedule(static,1) num_threads(num_threads)
#endif
for (int thread_id = 0; thread_id < num_threads; thread_id++) {
size_t ptn_lower = limits[thread_id];
size_t ptn_upper = limits[thread_id+1];
// first compute partial_lh
for (vector<TraversalInfo>::iterator it = traversal_info.begin(); it != traversal_info.end(); it++)
computePartialLikelihood(*it, ptn_lower, ptn_upper, thread_id);
// reset memory for _pattern_lh_cat
memset(_pattern_lh_cat+ptn_lower*ncat, 0, (ptn_upper-ptn_lower)*ncat*sizeof(double));
for (ptn = ptn_lower; ptn < ptn_upper; ptn++) {
double lh_ptn = ptn_invar[ptn];
double *lh_cat = _pattern_lh_cat + ptn*ncat;
double *partial_lh_dad = dad_branch->partial_lh + ptn*block;
double *partial_lh_node = node_branch->partial_lh + ptn*block;
double *trans_mat_tmp = trans_mat;
for (c = 0; c < ncat; c++) {
for (i = 0; i < nstates; i++) {
double lh_state = 0.0;
for (x = 0; x < nstates; x++)
lh_state += trans_mat_tmp[x] * partial_lh_node[x];
*lh_cat += partial_lh_dad[i] * lh_state;
trans_mat_tmp += nstates;
}
lh_ptn += *lh_cat;
partial_lh_node += nstates;
partial_lh_dad += nstates;
lh_cat++;
}
ASSERT(lh_ptn > 0.0);
if (ptn < orig_nptn) {
lh_ptn = log(fabs(lh_ptn)) + (dad_branch->scale_num[ptn] + node_branch->scale_num[ptn])*LOG_SCALING_THRESHOLD;
_pattern_lh[ptn] = lh_ptn;
tree_lh += lh_ptn * ptn_freq[ptn];
} else {
// bugfix 2016-01-21, prob_const can be rescaled
if (dad_branch->scale_num[ptn] + node_branch->scale_num[ptn] >= 1)
lh_ptn *= SCALING_THRESHOLD;
// _pattern_lh[ptn] = lh_ptn;
prob_const += lh_ptn;
}
} // FOR ptn
} // FOR thread_id
}
if (std::isnan(tree_lh) || std::isinf(tree_lh)) {
cout << "WARNING: Numerical underflow caused by alignment sites";
i = aln->getNSite();
int j;
for (j = 0, c = 0; j < i; j++) {
ptn = aln->getPatternID(j);
if (std::isnan(_pattern_lh[ptn]) || std::isinf(_pattern_lh[ptn])) {
cout << " " << j+1;
c++;
if (c >= 10) {
cout << " ...";
break;
}
}
}
cout << endl;
// tree_lh = current_it->lh_scale_factor + current_it_back->lh_scale_factor;
tree_lh = 0.0;
for (ptn = 0; ptn < orig_nptn; ptn++) {
if (std::isnan(_pattern_lh[ptn]) || std::isinf(_pattern_lh[ptn])) {
_pattern_lh[ptn] = LOG_SCALING_THRESHOLD*4; // log(2^(-1024))
}
tree_lh += _pattern_lh[ptn] * ptn_freq[ptn];
}
}
if (orig_nptn < nptn) {
// ascertainment bias correction
if (prob_const >= 1.0 || prob_const < 0.0) {
printTree(cout, WT_TAXON_ID + WT_BR_LEN + WT_NEWLINE);
model->writeInfo(cout);
}
ASSERT(prob_const < 1.0 && prob_const >= 0.0);
// BQM 2015-10-11: fix this those functions using _pattern_lh_cat
// double inv_const = 1.0 / (1.0-prob_const);
// size_t nptn_cat = orig_nptn*ncat;
// for (ptn = 0; ptn < nptn_cat; ptn++)
// _pattern_lh_cat[ptn] *= inv_const;
prob_const = log(1.0 - prob_const);
for (ptn = 0; ptn < orig_nptn; ptn++)
_pattern_lh[ptn] -= prob_const;
tree_lh -= aln->getNSite()*prob_const;
ASSERT(!std::isnan(tree_lh) && !std::isinf(tree_lh));
}
ASSERT(!std::isnan(tree_lh) && !std::isinf(tree_lh));
delete [] trans_mat;
return tree_lh;
}
|
