-
Notifications
You must be signed in to change notification settings - Fork 28
Expand file tree
/
Copy pathNussinovHandler.cpp
More file actions
203 lines (187 loc) · 6.19 KB
/
NussinovHandler.cpp
File metadata and controls
203 lines (187 loc) · 6.19 KB
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
#include "IntaRNA/NussinovHandler.h"
namespace IntaRNA {
void
NussinovHandler::getBasePairs(
const size_t from,
const size_t to,
const IdxMatrix &traceback,
Interaction::PairingVec &pairs)
{
if (from >= to) {
return ;
}
if (traceback(from, to) == to) {
getBasePairs(from, to - 1, traceback, pairs);
} else {
size_t k = traceback(from, to);
if (from + 1 <= k) {
getBasePairs(from, k - 1, traceback, pairs);
}
if (k + 2 <= to) {
getBasePairs(k + 1, to - 1, traceback, pairs);
}
pairs.push_back(Interaction::BasePair(k, to));
}
}
std::string
NussinovHandler::dotBracket(const size_t from, const size_t to,
const RnaSequence &seq, const size_t minLoopLength, const E_type basePairEnergy)
{
const size_t len = to - from + 1, offset = from;
NussinovHandler::E2dMatrix nussinov(len + 1, len + 1);
NussinovHandler::IdxMatrix traceback(len + 1, len + 1);
for (size_t i = 0; i < len; ++i)
for (size_t j = i; j < len; ++j)
nussinov(i, j) = 0, traceback(i, j) = j;
for (size_t dis = 1; dis < len; ++dis) {
for (size_t beg = 0; beg + dis < len; ++beg) {
const size_t i = beg, j = beg + dis;
nussinov(i, j) = nussinov(i, j - 1);
traceback(i, j) = j;
for (size_t k = i; k + minLoopLength < j; ++k) {
if (RnaSequence::areComplementary(seq, seq, offset + k, offset + j)) {
const E_type val = ((i + 1 <= k) ? nussinov(i , k - 1) : 0) + ((k + 2 <= j) ? nussinov(k + 1, j - 1) : 0) + basePairEnergy;
if (val < nussinov(i, j)) {
nussinov(i, j) = val;
traceback(i, j) = k;
}
}
}
}
}
std::string result(len, '.');
Interaction::PairingVec basepairs;
getBasePairs(0, len - 1, traceback, basepairs);
for (size_t k = 0; k < basepairs.size(); ++k) {
size_t i = basepairs[k].first, j = basepairs[k].second;
// assert(result[i] == '.' && result[j] == '.');
result[i] = '(';
result[j] = ')';
}
return result;
}
Z_type
NussinovHandler::getQ(const size_t i, const size_t j, const RnaSequence &seq,
const Z_type bpWeight, const size_t minLoopLength,
NussinovHandler::Z2dMatrix &Q, NussinovHandler::Z2dMatrix &Qb) {
if (i >= j || j >= seq.size()) {
return 1.0;
}
Z_type &ret = Q(i, j);
// If value is already computed, return it
if (ret > -0.5) {
return ret;
}
// Else compute Q
ret = (j>0?getQ(i, j - 1, seq, bpWeight, minLoopLength, Q, Qb):1.0);
for (size_t k = i; k + minLoopLength < j; ++k) {
ret += ( (k>0?getQ(i, k - 1, seq, bpWeight, minLoopLength, Q, Qb):1.0) *
getQb(k, j, seq, bpWeight, minLoopLength, Q, Qb));
}
return ret;
}
Z_type
NussinovHandler::getQb(const size_t i, const size_t j, const RnaSequence &seq,
const Z_type bpWeight, const size_t minLoopLength,
NussinovHandler::Z2dMatrix &Q, NussinovHandler::Z2dMatrix &Qb) {
if (j >= seq.size()) {
return 1.0;
}
if (i + minLoopLength >= j) {
return 0.0;
}
Z_type &ret = Qb(i, j);
// If value is already computed, return it
if (ret > -0.5) {
return ret;
}
// Else compute Qb
if (RnaSequence::areComplementary(seq, seq, i, j)) {
ret = getQ(i + 1, j - 1, seq, bpWeight, minLoopLength, Q, Qb) * bpWeight;
} else {
ret = 0.0;
}
return ret;
}
Z_type
NussinovHandler::getPbp(const size_t i, const size_t j, const RnaSequence &seq,
const Z_type bpWeight, const size_t minLoopLength,
NussinovHandler::Z2dMatrix &Q, NussinovHandler::Z2dMatrix &Qb,
NussinovHandler::Z2dMatrix &Ppb) {
if (j >= seq.size() || i + minLoopLength >= j) {
return 0.0;
}
Z_type &ret = Ppb(i, j);
// If value is already computed, return it
if (ret > -0.5) {
return ret;
}
// Else compute Pbp
ret = (getQb(i, j, seq, bpWeight, minLoopLength, Q, Qb) *
(i>0?getQ(0, i - 1, seq, bpWeight, minLoopLength, Q, Qb):1.0) *
getQ(j + 1, seq.size() - 1, seq, bpWeight, minLoopLength, Q, Qb) /
getQ(0, seq.size() - 1, seq, bpWeight, minLoopLength, Q, Qb));
for (size_t p = 0; p < i; ++p) {
for (size_t q = j + 1; q < seq.size(); ++q) {
if (p+minLoopLength < q && RnaSequence::areComplementary(seq, seq, p, q)) {
ret += (bpWeight *
getPbp(p, q, seq, bpWeight, minLoopLength, Q, Qb, Ppb) *
getQ(p + 1, i - 1, seq, bpWeight, minLoopLength, Q, Qb) *
getQb(i, j, seq, bpWeight, minLoopLength, Q, Qb) *
getQ(j + 1, q - 1, seq, bpWeight, minLoopLength, Q, Qb) /
getQb(p, q, seq, bpWeight, minLoopLength, Q, Qb));
}
}
}
return ret;
}
Z_type
NussinovHandler::getPu(const size_t i, const size_t j, const RnaSequence &seq,
const Z_type bpWeight, const size_t minLoopLength,
NussinovHandler::Z2dMatrix &Q, NussinovHandler::Z2dMatrix &Qb,
NussinovHandler::Z2dMatrix &Pbp, NussinovHandler::Z2dMatrix &Pu) {
if (i > j || j >= seq.size()) {
return 0.0;
}
// referencing cell access to enable Pu update if needed
Z_type &curPu = Pu(i, j);
// If value is already computed, return it
if (curPu > -0.5) {
return curPu;
}
// Else compute Pu
curPu = ((i>0?getQ(0, i - 1, seq, bpWeight, minLoopLength, Q, Qb):1.0) *
getQ(j + 1, seq.size() - 1, seq, bpWeight, minLoopLength, Q, Qb) /
getQ(0, seq.size() - 1, seq, bpWeight, minLoopLength, Q, Qb));
for (size_t p = 0; p < i; ++p) {
for (size_t q = j + 1; q < seq.size(); ++q) {
if (p+minLoopLength<q && RnaSequence::areComplementary(seq, seq, p, q)) {
curPu += (bpWeight *
getPbp(p, q, seq, bpWeight, minLoopLength, Q, Qb, Pbp) *
getQ(p + 1, i - 1, seq, bpWeight, minLoopLength, Q, Qb) *
getQ(j + 1, q - 1, seq, bpWeight, minLoopLength, Q, Qb) /
getQb(p, q, seq, bpWeight, minLoopLength, Q, Qb));
}
}
}
return curPu;
}
void
NussinovHandler::
printMatrix( std::ostream & out, const NussinovHandler::E2dMatrix &M)
{
std::cout <<"\n\n########\n";
for (int i =0; i<M.size1(); i++) {
std::cout <<(i);
for (int j=0; j <M.size2(); j++) {
if (j<i) {
std::cout <<" ---";
} else {
std::cout <<" "<<M(i,j);
}
}
std::cout <<std::endl;
}
std::cout <<"########\n";
}
} // namespace IntaRNA