-
Notifications
You must be signed in to change notification settings - Fork 0
/
ctwc__distance_matrix.py
executable file
·355 lines (309 loc) · 13.7 KB
/
ctwc__distance_matrix.py
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
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
#!/usr/bin/python
from ctwc__common import *
from multiprocessing import Pool
import warnings
import ctwc__data_handler
import numpy as np
import math
REAL_DATA = True
USE_LOG_XFORM = True
WEIGHTED_UNIFRAC = False
NORMALIZE_FACTOR = 100.0
OTU_THRESHOLD = 10 / NORMALIZE_FACTOR
SAMPLE_THRESHOLD = 2 / NORMALIZE_FACTOR
NUM_THREADS = 32
COL_DISTANCE_MATRIX_FILE = './sample_distance.dat'
ROW_DISTANCE_MATRIX_FILE = './bacteria_distance.dat'
UNIFRAC_DIST_FILE = RESULTS_PATH+"unifrac_dist_mat-{0}.pklz"
SQUARE_UNIFRAC_DISTANCE = False
INF_VALUE = 1.0001
ALLOW_CACHING = False
def __unifrac_prepare_entry_for_dictionary(args):
data, otu_ind, otu, otus, otu_filter, samples, sample_filter = args
samp_dict = {}
for samp_ind, samp in enumerate(samples):
if ((sample_filter is not None and not has_value(sample_filter, samp))
or
(otu_filter is not None and not has_value(otu_filter, otu))):
continue
if USE_LOG_XFORM:
samp_dict[samp] = 0 if data[samp_ind, otu_ind] < SAMPLE_THRESHOLD else np.log2(data[samp_ind, otu_ind]*NORMALIZE_FACTOR)
else:
samp_dict[samp] = 0 if data[samp_ind, otu_ind] < SAMPLE_THRESHOLD else data[samp_ind, otu_ind]*NORMALIZE_FACTOR
return {otu:samp_dict}
def __unifrac_prepare_dictionary_from_matrix_rows(data, samples, otus, sample_filter, otu_filter):
num_samples, num_otus_in_sample = data.shape
if num_samples != len(samples):
FATAL("Number of sample lables {0} does not match number of samples {1}".format(num_samples, len(samples)))
if num_otus_in_sample != len(otus):
FATAL("Number of otus labels {0} does not match number of samples {1}".format(num_otus_in_sample, len(otus)))
full_dict = {}
args = []
# Transforming to sets (O(n) operation) in order to turn "has_value" lookup from O(log(n)) to O(1))
# All in all it should turn the process of creating the dictionary to linear instead of O(nlog(n))
otu_filter_set = None if otu_filter is None else set(otu_filter)
sample_filter_set = None if sample_filter is None else set(sample_filter)
for otu_ind, otu in enumerate(otus):
args.append((data, otu_ind, otu, otus, otu_filter_set, samples, sample_filter_set))
p = Pool(NUM_THREADS)
retvals = p.map(__unifrac_prepare_entry_for_dictionary, args)
for retVal in retvals:
full_dict.update(retVal)
p.terminate()
return full_dict
def __reorder_unifrac_distance_matrix_by_original_samples(unifrac_output, samples, sample_filter, otu_filter):
uf_dist_mat = unifrac_output[0]
uf_samples = unifrac_output[1]
z = np.zeros((len(samples), len(samples)))
z[:,:] = INF_VALUE
np.fill_diagonal(z, 0.0)
mx = np.max(uf_dist_mat) * 1.0
for samp_ind, samp in enumerate(samples):
if sample_filter is None or has_value(sample_filter, samp):
uf_ind = uf_samples.index(samp)
for other_ind, other_samp in enumerate(samples):
if sample_filter is None or has_value(sample_filter, other_samp):
uf_other_ind = uf_samples.index(other_samp)
z[samp_ind, other_ind] = uf_dist_mat[uf_ind, uf_other_ind] / mx
return z
def __get_precalculated_unifrac_file_if_exists(h):
return load_from_file(UNIFRAC_DIST_FILE.format(h))
def __calculate_hash_for_data(data, sample_filter, otu_filter):
return hash(str([ hash(data.tostring()), hash(str(sample_filter)), hash(str(otu_filter)) ]) ) # eh close enough
def __get_precalculated_unifrac_file_if_exists_for_data(data, sample_filter, otu_filter):
h = __calculate_hash_for_data(data, sample_filter, otu_filter)
return __get_precalculated_unifrac_file_if_exists(h)
def __save_calculated_unifrac_file_and_hash_for_data(data, sample_filter, otu_filter, mat):
if not ALLOW_CACHING:
return
DEBUG("Saving calculated Unifrac distance matrix to file...")
h = __calculate_hash_for_data(data, sample_filter, otu_filter)
save_to_file(mat, UNIFRAC_DIST_FILE.format(h))
def __get_mask_from_filter(mat, filt):
if filt is None:
return np.zeros(mat.shape, dtype=bool)
tmp_mask = np.ones(mat.shape[0], dtype=bool)
tmp_mask[filt] = False
mask = np.zeros(mat.shape, dtype=bool)
mask[ np.nonzero(tmp_mask == True) ] = True
mask[ : , np.nonzero(tmp_mask == True) ] = True
return mask
def unifrac_distance_rows(data, samples_arg=None, otus_arg=None, tree_arg=None, sample_filter=None, otu_filter=None):
DEBUG("Starting unifrac_distance_rows...")
with warnings.catch_warnings():
warnings.simplefilter("ignore")
from cogent.maths.unifrac.fast_unifrac import fast_unifrac
if samples_arg is None:
samples = get_default_samples()
elif callable(samples_arg):
samples = samples_arg()
else:
samples = samples_arg
if otus_arg is None:
otus = get_default_otus()
elif callable(otus_arg):
otus = otus_arg()
else:
otus = otus_arg
if tree_arg is None:
tree = get_default_tree(otus)
elif callable(tree_arg):
tree = tree_arg()
else:
tree = tree_arg
mat = __get_precalculated_unifrac_file_if_exists_for_data(data, sample_filter, otu_filter)
if mat is not None:
DEBUG("Found previously calculated Unifrac data")
return mat
DEBUG("Preparing data dictionary...")
data_dict = __unifrac_prepare_dictionary_from_matrix_rows(data, samples, otus, sample_filter, otu_filter)
DEBUG("Running fast_unifrac...")
unifrac = fast_unifrac(tree, data_dict, weighted=WEIGHTED_UNIFRAC)
DEBUG("Unifrac results: {0}".format(unifrac))
DEBUG("Reordering results...")
mat = __reorder_unifrac_distance_matrix_by_original_samples(unifrac['distance_matrix'], samples, sample_filter, otu_filter)
DEBUG("Fixing NaN/inf values...")
mat = np.nan_to_num(mat)
if SQUARE_UNIFRAC_DISTANCE:
mat = np.multiply(mat, mat)
__save_calculated_unifrac_file_and_hash_for_data(data, sample_filter, otu_filter, mat)
DEBUG("Finished calculating Samples distance matrix.")
return mat
def unifrac_distance_cols(data, samples_arg=None, otus_arg=None, tree_arg=None, sample_filter=None, otu_filter=None):
return unifrac_distance_rows(data.transpose(), samples_arg, otus_arg, tree_arg, sample_filter, otu_filter)
def dissimilarity_from_correlation(correlation):
ones = np.ones(correlation.shape)
dis = ones - abs(correlation)
dis = np.nan_to_num(dis)
np.fill_diagonal(dis, 0.0)
return dis
def pearson_distance_rows(data, samples, otus, sample_filter, otu_filter):
return __calculate_otu_distance_rows(data, samples, otus, sample_filter, otu_filter, 'pearson')
def jaccard_distance_rows(data, samples, otus, sample_filter, otu_filter):
return __calculate_otu_distance_rows(data, samples, otus, sample_filter, otu_filter, 'jaccard')
def __calculate_otu_distance_rows(data_in, samples, otus, sample_filter, otu_filter, metric):
DEBUG("Starting distance calculation using {0} as a metric...".format(metric))
data = np.copy(data_in) * NORMALIZE_FACTOR
DEBUG("Filtering Samples...")
try:
if samples is not list:
samples = samples.tolist()
if sample_filter is not None:
cols_filter = [ samples.index(samp) for samp in sample_filter ]
else:
cols_filter = None
except ValueError as e:
FATAL("Trying to filter out non-existing samples: {0}".format(str(e)))
if cols_filter is not None:
mask = np.ones(data.shape, dtype=bool)
mask[ :, cols_filter ] = False
data[mask] = 0
DEBUG("Filtering OTUs...")
try:
if otus is not list:
otus = otus.tolist()
if otu_filter is not None:
rows_filter = [ otus.index(otu) for otu in otu_filter ]
else:
rows_filter = None
except ValueError as e:
FATAL("Trying to filter out non-existing OTUs: {0}".format(str(e)))
if rows_filter is not None:
mask = np.ones(data.shape, dtype=bool)
mask[rows_filter] = False
data[mask] = 0
data[data < OTU_THRESHOLD] = 0.0
if metric == 'pearson':
if USE_LOG_XFORM:
DEBUG("Log transform OTU abundance...")
data = np.ma.log2(data)
res = __pearson_distance(data)
elif metric == 'jaccard':
res = __jaccard_distance(data)
else:
FATAL("Unknown metric requested: {0}".format(metric))
if rows_filter is not None:
exclude = list(set(range(res.shape[0])) - set(rows_filter))
filter_mask = np.zeros(res.shape, dtype=bool)
filter_mask[exclude] = True
filter_mask[:, exclude] = True
res[filter_mask] = INF_VALUE
DEBUG("Finished calculating OTU distance matrix.")
return res
def __pearson_distance(data):
DEBUG("Calculating Pearson correlation...")
correlation = np.corrcoef(data)
DEBUG("Calculating Pearson dissimilarity...")
res = dissimilarity_from_correlation(correlation)
return res
def __jaccard_distance(data):
DEBUG("Calculating Jaccard Index...")
bin_mat = np.zeros(data.shape)
bin_mat[data > 0] = 1
intersect_mat = np.dot(bin_mat, bin_mat.transpose()) # every cell is the number of common values, Jaccard nominator
row_sums = intersect_mat.diagonal()
union_mat = row_sums[:,None] + row_sums - intersect_mat
with np.errstate(invalid='ignore'):
jaccard_mat = np.divide(intersect_mat, union_mat)
jaccard_mat[np.isnan(jaccard_mat)] = 0 # it's 1 by definition but we want to ignore zero vectors
DEBUG("Calculating Jaccard dissimilarity...")
res = dissimilarity_from_correlation(jaccard_mat)
return res
def jaccard_distance_cols(data, samples, otus, sample_filter, otu_filter):
return jaccard_distance_rows(data.transpose(), samples, otus, sample_filter, otu_filter)
def pearson_distance_cols(data, samples, otus, sample_filter, otu_filter):
return pearson_distance_rows(data.transpose(), samples, otus, sample_filter, otu_filter)
def euclidean_distance_cols(data, sample_filter, otu_filter, samples, otus):
data = data.copy()
if sample_filter is not None:
samples = samples.tolist()
cols_filter = set(
[samples.index(samp) for samp in sample_filter]
)
if otu_filter is not None:
otus = otus.tolist()
rows_filter = [otus.index(otu) for otu in otu_filter]
mask = np.ones(data.shape, dtype=bool)
mask[rows_filter] = False
data[mask] = 0
def _dist(a, b):
return numpy.linalg.norm(a-b)
_, num_cols = data.shape
output = np.zeros((num_cols, num_cols))
for i in xrange(num_cols):
for j in xrange(num_cols):
if sample_filter is not None and (
i not in cols_filter or j not in cols_filter
):
output[i][j] = INF_VALUE
else:
output[i][j] = _dist(data[:,i], data[:,j])
for i in xrange(num_cols):
output[i][i] = 0.0
return output
def euclidean_distance_rows(data, sample_filter, otu_filter, samples, otus):
data = data.copy()
if otu_filter is not None:
otus = otus.tolist()
rows_filter = set(
[otus.index(otu) for otu in otu_filter]
)
if sample_filter is not None:
samples = samples.tolist()
cols_filter = [samples.index(sample) for sample in sample_filter]
mask = np.ones(data.shape, dtype=bool)
mask[:,cols_filter] = False
data[mask] = 0
def _dist(a, b):
return numpy.linalg.norm(a-b)
num_rows, _ = data.shape
output = np.zeros((num_rows, num_rows))
for i in xrange(num_rows):
for j in xrange(num_rows):
if otu_filter is not None and (
i not in rows_filter or j not in rows_filter
):
output[i][j] = INF_VALUE
else:
output[i][j] = _dist(data[i], data[j])
for i in xrange(num_rows):
output[i][i] = 0.0
return output
def get_distance_matrices(data, tree, samples, otus, sample_filter=None, otu_filter=None, skip_cols=False, skip_rows=False):
cols_dist = None
rows_dist = None
if not skip_cols:
cols_dist = unifrac_distance_cols(data=data, samples_arg=samples, otus_arg=otus, tree_arg=tree, sample_filter=sample_filter, otu_filter=otu_filter)
if not skip_rows:
rows_dist = jaccard_distance_rows(data, samples, otus, sample_filter, otu_filter)
return rows_dist, cols_dist
def get_data(use_real_data=True, full_set=True, jagged=False):
if use_real_data:
INFO("Using real data")
data, otus, samples, table = ctwc__data_handler.get_sample_biom_table(full_set=full_set)
else:
INFO("Using synthetic data")
if jagged:
data, otus, samples, table = ctwc__data_handler.get_synthetic_biom_table_jagged(full_set=full_set)
else:
data, otus, samples, table = ctwc__data_handler.get_synthetic_biom_table_single_axis_noise(full_set=full_set)
tree = ctwc__data_handler.get_gg_97_otu_tree()
return samples, otus, tree, data, table
def __get_output_filename_by_type(mat_type):
if mat_type == 'col':
return COL_DISTANCE_MATRIX_FILE
elif mat_type == 'row':
return ROW_DISTANCE_MATRIX_FILE
else:
FATAL('Unknown matrix type')
def test():
samples, otus, tree, data, table = get_data(REAL_DATA)
INFO("Calculating cols dist")
_, cols_dist = get_distance_matrices(data, tree, samples, otus, skip_rows=True)
INFO("Calculating rows dist")
rows_dist, _ = get_distance_matrices(data, tree, samples, otus, skip_cols=True)
#otu_filter = otus
#sample_filter = samples
#rows_dist, cols_dist = get_distance_matrices(data, tree, samples, otus, otu_filter=otu_filter, sample_filter=sample_filter)
if __name__ == '__main__':
test()