-
Notifications
You must be signed in to change notification settings - Fork 37
/
lhmm.h
203 lines (161 loc) · 5.27 KB
/
lhmm.h
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
/* The MIT License
Copyright (c) 2013 Adrian Tan <[email protected]>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#ifndef LHMM_H
#define LHMM_H
#include "utils.h"
#include "log_tool.h"
#include <regex.h>
class LHMM
{
public:
const char* x;
const char* y;
const char* qual;
std::vector<std::vector<double> > X;
std::vector<std::vector<double> > Y;
std::vector<std::vector<double> > M;
std::vector<std::vector<double> > I;
std::vector<std::vector<double> > D;
std::vector<std::vector<double> > W;
std::vector<std::vector<double> > Z;
std::vector<std::vector<char> > pathX;
std::vector<std::vector<char> > pathY;
std::vector<std::vector<char> > pathM;
std::vector<std::vector<char> > pathD;
std::vector<std::vector<char> > pathI;
std::vector<std::vector<char> > pathW;
std::vector<std::vector<char> > pathZ;
std::vector<double> PLs;
uint32_t maxLength;
uint32_t xlen;
uint32_t ylen;
std::string path;
double maxLogOdds;
double delta;
double epsilon;
double tau;
double eta;
double logOneSixteenth;
// double a;
// double e;
// double d;
// double c;
double logEta;
double logTau;
double tsx;
double txx;
double tsy;
double txy;
double tyy;
double txm;
double tym;
double txi;
double txd;
double tsm;
double tmm;
double tim;
double tdm;
double tmi;
double tmd;
double tii;
double tdd;
double tyi;
double tyd;
double tmw;
double tiw;
double tdw;
double tww;
double tmz;
double tiz;
double tdz;
double twz;
double tzz;
double tMM;
double tMI;
double tMD;
double tII;
double tDD;
double tDM;
double tIM;
int32_t matchStartX;
int32_t matchEndX;
int32_t matchStartY;
int32_t matchEndY;
int32_t matchedBases;
int32_t mismatchedBases;
std::vector<uint32_t> indelStartsInX;
std::vector<uint32_t> indelEndsInX;
std::vector<uint32_t> indelStartsInY;
std::vector<uint32_t> indelEndsInY;
std::vector<uint32_t> indelStartsInPath;
std::vector<uint32_t> indelEndsInPath;
std::vector<char> indelStatusInPath;
uint32_t noBasesAligned;
LogTool lt;
/*Constructor*/
LHMM();
bool containsIndel();
/**
* Convert PLs to probabilities.
*/
double pl2prob(uint32_t PL);
/**
* Updates matchStart, matchEnd, globalMaxPath and path
* Updates locations of insertions and deletions
*/
void tracePath();
void tracePath(std::stringstream& ss, char state, uint32_t i, uint32_t j);
/**
* Align and compute genotype likelihood.
*/
void align(double& llk, const char* _x, const char* _y, const char* qual, bool debug=false);
//computes log likelihood based on path given in arguments
void computeLogLikelihood(double& llk, double& perfectllk, std::string& _path, const char* qual);
//computes log likelihood based on path given in arguments
void computeLogLikelihood(double& llk, std::string& _path, const char* qual);
//computes log likelihood based on path saved
void computeLogLikelihood(double& llk, const char* qual);
//get path
std::string& getPath();
/**
* Left align indels in an alignment
*/
void left_align();
double logEmissionOdds(char readBase, char probeBase, double e);
//compute log emission based on equal error probability distribution
double logEmission(char readBase, char probeBase, double e);
double emission(char readBase, char probeBase, double e);
std::string reverse(std::string s);
void printVector(std::vector<std::vector<double> >& v, uint32_t xLen, uint32_t yLen);
void printVector(std::vector<std::vector<char> >& v, uint32_t xLen, uint32_t yLen);
void printVector(std::vector<std::vector<double> >& v);
void printAlignment();
void printAlignment(std::string& pad);
void printAlignment(std::string& pad, std::stringstream& log);
double score(char a, char b);
/**
* Checks if deletion exists in alignment.
*/
bool deletion_start_exists(uint32_t pos, uint32_t& rpos);
/**
* Checks if insertion exists in alignment.
*/
bool insertion_start_exists(uint32_t pos, uint32_t& rpos);
};
#endif