-
Notifications
You must be signed in to change notification settings - Fork 0
/
expression.cpp
235 lines (206 loc) · 6.47 KB
/
expression.cpp
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
//
// expression.cpp
// APOBECXP
//
// Created by Marat Kazanov on 16/12/2018.
// Copyright © 2018 Marat Kazanov. All rights reserved.
//
#include "expression.hpp"
#include <fstream>
#include "service.h"
#include <iostream>
#include "mutsignature.hpp"
#include <cstring>
CExpressionKey::CExpressionKey(string geneId_, string sample_)
{
geneId = str2ul(geneId_);
sample = sample_;
}
CExpressionKey::CExpressionKey(unsigned long geneId_, string sample_)
{
geneId = geneId_;
sample = sample_;
}
CExpressionBin::CExpressionBin(int binNum_, double expressionLeft_, double expressionRight_)
{
binNum = binNum_;
expressionLeft = expressionLeft_;
expressionRight = expressionRight_;
}
void CExpression::LoadExpression(string path, string sample)
{
cout << "Load expression" << '\n';
string line;
string geneId,smpl;
ifstream f(path.c_str());
if (!f.is_open())
{
printf("File not exists\n");
return;
}
vector<string> flds,flds1;
while(getline(f, line))
{
if (line.length() != 0)
{
flds = split(line);
smpl = flds[1].substr(0,16);
if(sample != "" && smpl != sample)
continue;
flds1 = splitd(flds[0],'|');
geneId = flds1[1];
if(sample == "")
data.insert(pair<CExpressionKey,double>(CExpressionKey(geneId,smpl),str2d(flds[2])));
else
dataSample[str2ul(geneId)] = str2d(flds[2]);
}
}
}
int CExpression::GetExpression(unsigned long geneId, string sample, double& expressionValue)
{
unordered_map<CExpressionKey,double,hash_pair>::iterator it;
unordered_map<unsigned long,double>::iterator its;
if(!data.empty())
{
it = data.find(CExpressionKey(geneId,sample));
if(it == data.end())
{
expressionValue = -1;
return(0);
}
else
{
expressionValue = it->second;
return(1);
}
}
else if (!dataSample.empty())
{
its = dataSample.find(geneId);
if(its == dataSample.end())
{
expressionValue = -1;
return(0);
}
else
{
expressionValue = its->second;
return(1);
}
}
else
{
cerr << "Error: expression data is empty!" << '\n';
return(0);
}
}
int CExpression::GetExpressionBinByValue(double expValue, vector<CExpressionBin> bins)
{
for(int i=0;i<bins.size();i++)
if(expValue >= bins[i].expressionLeft && expValue < bins[i].expressionRight)
return(bins[i].binNum);
return(-1);
}
int CExpression::GetExpressionBin(string sample, string chr, unsigned long pos, char isForwardMut, CHumanGenes& genes, vector<CExpressionBin>& expBins, int& strand, int& strandInconsistence)
{
vector<CHumanGene> geneList;
double expValue, maxexp;
int strandplus=0,strandminus=0;
int res;
int bin;
int expFound;
genes.GetGenesByPos(CHumanGenome::GetChrNum(string(chr)), pos, geneList);
if(geneList.empty())
{
strand = EXP_STRAND_NULL;
strandInconsistence = 0;
return(EXP_NULLBIN_NOTINGENES); // mutation not in genes
}
maxexp = -100000.0;
expFound = 0;
strand = 0;
for(int i=0;i<geneList.size();i++)
{
if((geneList[i].strand == '+' && isForwardMut == 1) || (geneList[i].strand == '-' && isForwardMut == 0))
strandplus++;
else if((geneList[i].strand == '-' && isForwardMut == 1) || (geneList[i].strand == '+' && isForwardMut == 0))
strandminus++;
res = GetExpression(geneList[i].geneID, sample, expValue);
if(res)
{
if(maxexp < expValue)
{
maxexp = expValue;
if((geneList[i].strand == '+' && isForwardMut == 1) || (geneList[i].strand == '-' && isForwardMut == 0))
strand = EXP_STRAND_PLUS;
else if((geneList[i].strand == '-' && isForwardMut == 1) || (geneList[i].strand == '+' && isForwardMut == 0))
strand = EXP_STRAND_MINUS;
else
strand = EXP_STRAND_NULL;
}
expFound = 1;
}
}
if(strandplus !=0 && strandminus !=0)
strandInconsistence = 1;
else
strandInconsistence = 0;
if(expFound == 0)
return(EXP_NULLBIN_NOEXPDATA); // mutation in genes, but no expression data
bin = GetExpressionBinByValue(maxexp, expBins);
return(bin);
}
map<int,unsigned long> CExpression::CalculateMotifsExpressionBins(vector<CExpressionBin> expBins, CHumanGenes& genes, set<string> motifs, string sample, CHumanGenome* phuman)
{
int i;
set<string> motifsall;
set<string>::iterator si;
int motiflen;
map<int,unsigned long> ret;
CMutationSignature msobj;
char** motifsarr;
int* strandarr;
msobj.CheckMotifsNotEmpty(motifs);
msobj.CheckMotifsSameLength(motifs);
motifsall = msobj.AddcMotifs(motifs);
motiflen = (int) (motifsall.begin())->length();
// Prepare char array for copying motifs
motifsarr = new char*[motifsall.size()];
strandarr = new int[motifsall.size()];
for(i=0;i<motifsall.size();i++)
{
motifsarr[i] = new char[motiflen];
if(i<motifs.size())
strandarr[i] = 1;
else
strandarr[i] = 0;
}
// Copy motifs to char array
i = 0;
for(si=motifsall.begin();si!=motifsall.end();si++)
{
strncpy(motifsarr[i],(*si).c_str(),(*si).length());
i++;
}
int motifsnum;
motifsnum = (int) motifsall.size();
unsigned long* cnt;
cnt = new unsigned long[(int)expBins.size() + (int)EXP_NULLBIN_CNT];
for(i=0;i<((int)expBins.size() + (int)EXP_NULLBIN_CNT);i++)
cnt[i] = 0;
int includeCurPos=1;
CDNAPos pos = CDNAPos(0,0);
int bin;
int strand;
int strandInconsistence;
for(pos=msobj.NextMotif(CDNAPos(0,0),motifsarr,strandarr,motifsnum,motiflen,phuman,END_GENOME,includeCurPos);
!pos.isNull();
pos=msobj.NextMotif(pos,motifsarr,strandarr,motifsnum,motiflen,phuman,END_GENOME))
{
bin = GetExpressionBin(sample, phuman->chrName[pos.chrNum], pos.pos, 1, genes, expBins, strand, strandInconsistence);
cnt[bin+EXP_NULLBIN_CNT]++;
}
for(i=0;i<((int)expBins.size() + (int)EXP_NULLBIN_CNT);i++)
ret[i-EXP_NULLBIN_CNT] = cnt[i];
return(ret);
}