-
Notifications
You must be signed in to change notification settings - Fork 2
/
bmtritomyML.go
178 lines (170 loc) · 4.14 KB
/
bmtritomyML.go
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
package clustering
import (
"fmt"
"math"
"os"
"github.com/FePhyFoFum/gophy"
)
//TritomySubML will calculate the MLEs for the branch lengths of a tifurcating 3-taxon tree using only the sites indicated in sites
func TritomySubML(tree *gophy.Node, sites []int) {
ntraits := len(sites)
fntraits := float64(ntraits)
var x1, x2, x3 float64
sumV1 := 0.0
sumV2 := 0.0
sumV3 := 0.0
for _, i := range sites {
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV1 += ((x1 - x2) * (x1 - x3))
sumV2 += ((x2 - x1) * (x2 - x3))
sumV3 += ((x3 - x1) * (x3 - x2))
}
if sumV1 < 0.0 {
sumV1 = 0.000001
sumV2 = 0.0
sumV3 = 0.0
for _, i := range sites {
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV2 += (x1 - x2) * (x1 - x2)
sumV3 += (x1 - x3) * (x1 - x3)
}
} else if sumV2 < 0.0 {
sumV1 = 0.0
sumV2 = 0.00001
sumV3 = 0.0
for _, i := range sites {
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV1 += (x2 - x1) * (x2 - x1)
sumV3 += (x2 - x3) * (x2 - x3)
}
} else if sumV3 < 0.0 {
sumV1 = 0.0
sumV2 = 0.0
sumV3 = 0.0001
for _, i := range sites {
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV1 += (x3 - x1) * (x3 - x1)
sumV2 += (x3 - x2) * (x3 - x2)
}
}
sumV1 = sumV1 / fntraits
sumV2 = sumV2 / fntraits
sumV3 = sumV3 / fntraits
sumV1 = sumV1 - (tree.Chs[0].PruneLen - tree.Chs[0].Len)
sumV2 = sumV2 - (tree.Chs[1].PruneLen - tree.Chs[1].Len)
sumV3 = sumV3 - (tree.Chs[2].PruneLen - tree.Chs[2].Len)
if sumV1 <= 0. {
sumV1 = 0.0001
}
if sumV2 <= 0. {
sumV2 = 0.0001
}
if sumV3 <= 0. {
sumV3 = 0.0001
}
tree.Chs[0].Len = sumV1
tree.Chs[1].Len = sumV2
tree.Chs[2].Len = sumV3
}
//TritomyWeightedML will calculate the MLEs for the branch lengths of a tifurcating 3-taxon tree
func TritomyWeightedML(tree *gophy.Node, weights map[int]float64) {
//ntraits := len(tree.Chs[0].ContData)
fntraits := 0.
for _, w := range weights {
fntraits += w
}
var x1, x2, x3 float64
sumV1 := 0.0
sumV2 := 0.0
sumV3 := 0.0
wt := 0.0
for i := range tree.Chs[0].ContData {
wt = weights[i]
if wt == 0.0 {
continue
}
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV1 += ((x1 - x2) * (x1 - x3)) * wt
sumV2 += ((x2 - x1) * (x2 - x3)) * wt
sumV3 += ((x3 - x1) * (x3 - x2)) * wt
}
if sumV1 <= 0.0 {
sumV1 = 0.000001
sumV2 = 0.0
sumV3 = 0.0
for i := range tree.Chs[0].ContData {
wt = weights[i]
if wt == 0.0 {
continue
}
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV2 += (x1 - x2) * (x1 - x2) * wt
sumV3 += (x1 - x3) * (x1 - x3) * wt
}
} else if sumV2 <= 0.0 {
sumV1 = 0.0
sumV2 = 0.00001
sumV3 = 0.0
for i := range tree.Chs[0].ContData {
wt = weights[i]
if wt == 0.0 {
continue
}
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV1 += (x2 - x1) * (x2 - x1) * wt
sumV3 += (x2 - x3) * (x2 - x3) * wt
}
} else if sumV3 <= 0.0 {
sumV1 = 0.0
sumV2 = 0.0
sumV3 = 0.0001
for i := range tree.Chs[0].ContData {
wt = weights[i]
if wt == 0.0 {
continue
}
x1 = tree.Chs[0].ContData[i]
x2 = tree.Chs[1].ContData[i]
x3 = tree.Chs[2].ContData[i]
sumV1 += (x3 - x1) * (x3 - x1) * wt
sumV2 += (x3 - x2) * (x3 - x2) * wt
}
}
sumV1 = sumV1 / fntraits
sumV2 = sumV2 / fntraits
sumV3 = sumV3 / fntraits
sumV1 = sumV1 - (tree.Chs[0].PruneLen - tree.Chs[0].Len)
sumV2 = sumV2 - (tree.Chs[1].PruneLen - tree.Chs[1].Len)
sumV3 = sumV3 - (tree.Chs[2].PruneLen - tree.Chs[2].Len)
if sumV1 <= 0. {
sumV1 = 0.0001
}
if sumV2 <= 0. {
sumV2 = 0.0001
}
if sumV3 <= 0. {
sumV3 = 0.0001
}
//fmt.Println(tree.Chs[0].Nam, sumV1, tree.Chs[1].Nam, sumV2, tree.Chs[2].Nam, sumV3)
if math.IsNaN(sumV1) || math.IsNaN(sumV2) || math.IsNaN(sumV3) {
fmt.Println(tree.Chs[0].Nam, sumV1, tree.Chs[1].Nam, sumV2, tree.Chs[2].Nam, sumV3)
os.Exit(0)
}
tree.Chs[0].Len = sumV1
tree.Chs[1].Len = sumV2
tree.Chs[2].Len = sumV3
}