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
|
#include <ctype.h>
#include <errno.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <zlib.h>
#include "kmer_utils.h"
#include "quikr.h"
void check_malloc(void *ptr, char *error) {
if (ptr == NULL) {
if(error != NULL) {
fprintf(stderr,"Error: %s\n", error);
}
else { fprintf(stderr, "Error: Could not allocate enough memory - %s\n", strerror(errno));
}
exit(EXIT_FAILURE);
}
}
void debug_arrays(double *count_matrix, struct matrix *sensing_matrix) {
FILE *count_fh = fopen("count.mat", "w");
FILE *sensing_fh = fopen("sensing.mat", "w");
unsigned long long width = pow_four(sensing_matrix->kmer);
unsigned long long i = 0;
unsigned long long j = 0;
for(i = 0; i < sensing_matrix->sequences; i++) {
for(j = 0; j < width - 1; j++)
fprintf(sensing_fh, "%lf\t", sensing_matrix->matrix[width*i + j]);
fprintf(sensing_fh, "%lf\n", sensing_matrix->matrix[width*i + width-1]);
}
fclose(sensing_fh);
for(j = 0; j < width - 1; j++)
fprintf(count_fh, "%lf\t", count_matrix[j]);
fprintf(count_fh, "%lf\n", count_matrix[width - 1]);
fclose(count_fh);
}
void normalize_matrix(double *matrix, unsigned long long height, unsigned long long width) {
unsigned long long x = 0;
unsigned long long y = 0;
for(x = 0; x < height; x++) {
double row_sum = 0;
for(y = 0; y < (width); y++)
row_sum = row_sum + matrix[width * x + y];
for(y = 0; y < (width); y++)
matrix[width * x + y] = matrix[width * x + y] / row_sum;
}
}
unsigned long long count_sequences(const char *filename) {
char *line = NULL;
size_t len = 0;
ssize_t read;
unsigned long long sequences = 0;
FILE *fh = fopen(filename, "r");
if(fh == NULL) {
fprintf(stderr, "could not open \"%s\"\n", filename );
return 0;
}
while ((read = getline(&line, &len, fh)) != -1) {
if(line[0] == '>')
sequences++;
}
free(line);
fclose(fh);
return sequences;
}
struct matrix *load_sensing_matrix(const char *filename, unsigned int target_kmer) {
char *line = NULL;
char **headers = NULL;
double *matrix = NULL;
unsigned int kmer = 0;
unsigned long long i = 0;
unsigned long long *row = NULL;
unsigned long long sequences = 0;
unsigned long long width = 0;
struct matrix *ret = NULL;
gzFile fh = NULL;
fh = gzopen(filename, "r");
if(fh == NULL) {
fprintf(stderr, "could not open %s", filename);
exit(EXIT_FAILURE);
}
line = malloc(1024 * sizeof(char));
check_malloc(line, NULL);
// Check for quikr
line = gzgets(fh, line, 1024);
if(strcmp(line, "quikr\n") != 0) {
fprintf(stderr, "This does not look like a quikr sensing matrix. Please check your path: %s\n", filename);
exit(EXIT_FAILURE);
}
// check version
line = gzgets(fh, line, 1024);
if(atoi(line) != MATRIX_REVISION) {
fprintf(stderr, "Sensing Matrix uses an unsupported version, please retrain your matrix\n");
exit(EXIT_FAILURE);
}
// get number of sequences
line = gzgets(fh, line, 1024);
sequences = strtoull(line, NULL, 10);
if(sequences == 0) {
fprintf(stderr, "Error parsing sensing matrix, sequence count is zero\n");
exit(EXIT_FAILURE);
}
// get kmer
gzgets(fh, line, 1024);
kmer = atoi(line);
if(kmer == 0) {
fprintf(stderr, "Error parsing sensing matrix, kmer is zero\n");
exit(EXIT_FAILURE);
}
if(kmer != target_kmer) {
fprintf(stderr, "The sensing_matrix was trained with a different kmer than your requested kmer\n");
exit(EXIT_FAILURE);
}
width = pow_four(kmer);
// allocate a +1 size for the extra row
matrix = malloc(sequences * (width) * sizeof(double));
check_malloc(matrix, NULL);
row = malloc((width) * sizeof(unsigned long long));
check_malloc(row, NULL);
headers = malloc(sequences * sizeof(char *));
check_malloc(headers, NULL);
for(i = 0; i < sequences; i++) {
unsigned long long j = 0;
// get header and add it to headers array
char *header = malloc(256 * sizeof(char));
check_malloc(header, NULL);
gzgets(fh, header, 256);
if(header[0] != '>') {
fprintf(stderr, "Error parsing sensing matrix, could not read header\n");
exit(EXIT_FAILURE);
}
header[strlen(header) - 1] = '\0';
headers[i] = header+1;
row = memset(row, 0, (width) * sizeof(unsigned long long));
for(j = 0; j < width; j++) {
line = gzgets(fh, line, 32);
if(line == NULL || line[0] == '>') {
fprintf(stderr, "Error parsing sensing matrix, line does not look like a value\n");
exit(EXIT_FAILURE);
}
row[j] = strtoull(line, NULL, 10);
if(errno) {
printf("could not parse '%s'\n into a number", line);
exit(EXIT_FAILURE);
}
}
for(j = 0; j < width; j++) {
matrix[i*(width) + j] = ((double)row[j]);
}
}
// load the matrix of counts
gzclose(fh);
free(line);
free(row);
ret = malloc(sizeof(struct matrix));
(*ret).kmer = kmer;
(*ret).sequences = sequences;
(*ret).matrix = matrix;
(*ret).headers = headers;
return ret;
}
|
