-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsubnetwork.cpp
More file actions
162 lines (142 loc) · 4.34 KB
/
subnetwork.cpp
File metadata and controls
162 lines (142 loc) · 4.34 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
#include "subnetwork.h"
SubnetworkEntry::SubnetworkEntry() : samples(nullptr), valid(true) {}
SubnetworkEntry::SubnetworkEntry(int totalNumSamples) : valid(true) {
samples = new Bitmask(totalNumSamples);
}
SubnetworkEntry::SubnetworkEntry(const Bitmask & samples) : valid(true) {
this->samples = new Bitmask(samples);
}
SubnetworkEntry::SubnetworkEntry(const Bitmask * samples) : valid(true) {
this->samples = new Bitmask(samples);
}
SubnetworkEntry::SubnetworkEntry(const SubnetworkEntry & Q) : valid(Q.valid) {
nodes = Q.nodes;
samples = new Bitmask(Q.samples);
name = Q.name;
}
// SubnetworkEntry::SubnetworkEntry(const std::unordered_map<int, llu> & nodes, const Bitmask & samples) : valid(true) {
SubnetworkEntry::SubnetworkEntry(const std::map<int, llu> & nodes, const Bitmask & samples) : valid(true) {
this->nodes = nodes;
this->samples = new Bitmask(samples);
}
SubnetworkEntry::~SubnetworkEntry(){
if (samples) {
delete samples;
samples = nullptr;
}
}
void SubnetworkEntry::operator=(const SubnetworkEntry & Q) {
valid = Q.valid;
nodes = Q.nodes;
samples = new Bitmask(Q.samples);
name = Q.name;
}
void SubnetworkEntry::addNode(int nodeIdx, int altIdx) {
llu mask = (llu(1) << altIdx);
if (!nodes.count(nodeIdx))
nodes[nodeIdx] = mask;
else
nodes[nodeIdx] |= mask;
}
int SubnetworkEntry::removeSamplesWithMoreThanOneAlteration(Bitmask *** geneSampleAlterations) {
Bitmask tempmask(this->samples);
int numRemovedSamples = 0;
while (tempmask.getSize()) {
int sampleIdx = tempmask.extractLowestOrderSetBitIndex();
int numAlteredGenes = 0;
for (auto & it: nodes) {
int nodeIdx = it.first;
Bitmask alterationMask(64);
alterationMask.copylluBitmask(it.second);
bool geneAltered = false;
while (alterationMask.getSize()) {
int altIdx = alterationMask.extractLowestOrderSetBitIndex();
if (geneSampleAlterations[altIdx][nodeIdx] == nullptr) {
fprintf(stderr, "< Error in SubnetworkEntry::removeSamplesWithMoreThanOneAlteration > There is a node without a colour in the constructed ME subnetwork.\n");
exit(0);
}
geneAltered |= geneSampleAlterations[altIdx][nodeIdx]->getBit(sampleIdx);
}
numAlteredGenes += geneAltered;
}
if (numAlteredGenes > 1) {
samples->setBit(sampleIdx, 0);
numRemovedSamples++;
}
}
return numRemovedSamples;
}
SubnetworkMask::SubnetworkMask() : len(0), mask(nullptr) {}
SubnetworkMask::SubnetworkMask(const std::map<int, llu> & nodes, const int bitsInNode, const int bitsInAlt) {
int size = nodes.size();
int totalBits = bitsInNode + bitsInAlt;
len = (size * totalBits) / 64 + ((size * totalBits) % 64 != 0);
mask = new llu [len];
memset(mask, 0, sizeof(mask[0]) * len);
int i = 0;
for (auto const & it : nodes) {
int nodeIdx = it.first;
llu altMask = it.second;
llu nodeMask = (llu(nodeIdx) << bitsInAlt) + altMask;
int startBit = i * totalBits;
int startBucket = startBit / 64;
startBit %= 64;
int endBit = (i + 1) * totalBits - 1;
int endBucket = endBit / 64;
endBit %= 64;
mask[startBucket] |= nodeMask << startBit;
if (startBucket < endBucket)
mask[endBucket] |= nodeMask >> (totalBits - endBit - 1);
i++;
}
}
SubnetworkMask::SubnetworkMask(const SubnetworkMask & Q) {
len = Q.len;
mask = new llu [len];
for (int i = 0; i < len; i++) {
mask[i] = Q.mask[i];
}
}
void SubnetworkMask::operator=(const SubnetworkMask & Q) {
if (len != Q.len) {
delete mask;
mask = new llu [Q.len];
}
len = Q.len;
for (int i = 0; i < len; i++) {
mask[i] = Q.mask[i];
}
}
bool SubnetworkMask::operator==(const SubnetworkMask & Q) const {
if (len != Q.len)
return false;
for (int i = 0; i < len; i++) {
if (mask[i] != Q.mask[i])
return false;
}
return true;
}
bool SubnetworkMask::operator<(const SubnetworkMask & Q) const {
if (len != Q.len)
return (len < Q.len);
for (int i = 0; i < len; i++) {
if (mask[i] != Q.mask[i])
return (mask[i] < Q.mask[i]);
}
return false;
}
bool SubnetworkMask::operator>(const SubnetworkMask & Q) const {
if (len != Q.len)
return (len > Q.len);
for (int i = 0; i < len; i++) {
if (mask[i] != Q.mask[i])
return (mask[i] > Q.mask[i]);
}
return false;
}
SubnetworkMask::~SubnetworkMask(){
if (mask != nullptr) {
delete mask;
mask = nullptr;
}
}