-
Notifications
You must be signed in to change notification settings - Fork 80
/
_minhash.py
603 lines (484 loc) · 18.7 KB
/
_minhash.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
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
# -*- coding: UTF-8 -*-
from __future__ import unicode_literals, division
import math
import copy
from . import VERSION
from ._compat import string_types, range_type
from ._lowlevel import ffi, lib
from .utils import RustObject, rustcall, decode_str
from .exceptions import SourmashError
from deprecation import deprecated
# default MurmurHash seed
MINHASH_DEFAULT_SEED = 42
def get_minhash_default_seed():
"Return the default seed value used for the MurmurHash hashing function."
return MINHASH_DEFAULT_SEED
# we use the 64-bit hash space of MurmurHash only
# this is 2 ** 64 - 1 in hexadecimal
MINHASH_MAX_HASH = 0xFFFFFFFFFFFFFFFF
def get_minhash_max_hash():
"Return the maximum hash value."
return MINHASH_MAX_HASH
def get_max_hash_for_scaled(scaled):
"Convert a 'scaled' value into a 'max_hash' value."
if scaled == 0:
return 0
elif scaled == 1:
return get_minhash_max_hash()
return int(round(get_minhash_max_hash() / scaled, 0))
def get_scaled_for_max_hash(max_hash):
"Convert a 'max_hash' value into a 'scaled' value."
if max_hash == 0:
return 0
return int(round(get_minhash_max_hash() / max_hash, 0))
def to_bytes(s):
# Allow for strings, bytes or int
# Single item of byte string = int
if isinstance(s, bytes):
return s
if not isinstance(s, string_types + (bytes, int)):
raise TypeError("Requires a string-like sequence")
if isinstance(s, string_types):
s = s.encode("utf-8")
elif isinstance(s, int):
s = bytes([s])
return s
def hash_murmur(kmer, seed=MINHASH_DEFAULT_SEED):
"hash_murmur(string, [,seed])\n\n"
"Compute a hash for a string, optionally using a seed (an integer). "
"The current default seed is returned by hash_seed()."
return lib.hash_murmur(to_bytes(kmer), seed)
class MinHash(RustObject):
"""\
The core sketch object for sourmash.
MinHash objects store and provide functionality for subsampled hash values
from DNA, RNA, and amino acid sequences. MinHash also supports both the
standard MinHash behavior (bounded size or ``num``) and a non-standard
MinHash, called "modulo hash" behavior, or ``scaled``. Please see
the API examples at
https://sourmash.readthedocs.io/en/latest/api-example.html#sourmash-minhash-objects-and-manipulations
for more information.
Basic usage:
>>> from sourmash import MinHash
>>> mh1 = MinHash(n=20, ksize=3)
>>> mh1.add_sequence('ATGAGAGACGATAGACAGATGAC')
>>> mh2 = MinHash(n=20, ksize=3)
>>> mh2.add_sequence('ATGAGActCGATAGaCAGATGAC')
>>> round(mh1.similarity(mh2), 2)
0.85
"""
__dealloc_func__ = lib.kmerminhash_free
def __init__(
self,
n,
ksize,
is_protein=False,
dayhoff=False,
hp=False,
track_abundance=False,
seed=MINHASH_DEFAULT_SEED,
max_hash=0,
mins=None,
scaled=0,
):
"""\
Create a sourmash.MinHash object.
To create a standard (``num``) MinHash, use:
``MinHash(<num>, <ksize>, ...)``
To create a ``scaled`` MinHash, use
``MinHash(0, <ksize>, scaled=<int>, ...)``
Optional arguments:
* is_protein (default False) - aa k-mers
* dayhoff (default False) - dayhoff encoding
* hp (default False) - hydrophilic/hydrophobic aa
* track_abundance (default False) - track hash multiplicity
* mins (default None) - list of hashvals, or (hashval, abund) pairs
* seed (default 42) - murmurhash seed
Deprecated: @CTB
* ``max_hash=<int>``; use ``scaled`` instead.
"""
if max_hash and scaled:
raise ValueError("cannot set both max_hash and scaled")
elif scaled:
max_hash = get_max_hash_for_scaled(scaled)
if max_hash and n:
raise ValueError("cannot set both n and max_hash")
if not n and not (max_hash or scaled):
raise ValueError("cannot omit both n and scaled")
if dayhoff or hp:
is_protein = False
self._objptr = lib.kmerminhash_new(
n, ksize, is_protein, dayhoff, hp, seed, int(max_hash), track_abundance
)
if mins:
if track_abundance:
self.set_abundances(mins)
else:
self.add_many(mins)
def __copy__(self):
"Create a new copy of this MinHash."
a = MinHash(
self.num,
self.ksize,
is_protein=self.is_protein,
dayhoff=self.dayhoff,
hp=self.hp,
track_abundance=self.track_abundance,
seed=self.seed,
max_hash=self.max_hash,
)
a.merge(self)
return a
def __getstate__(self):
"support pickling via __getstate__/__setstate__"
return (
self.num,
self.ksize,
self.is_protein,
self.dayhoff,
self.hp,
self.get_mins(with_abundance=self.track_abundance),
None,
self.track_abundance,
self.max_hash,
self.seed,
)
def __setstate__(self, tup):
"support pickling via __getstate__/__setstate__"
(n, ksize, is_protein, dayhoff, hp, mins, _, track_abundance,
max_hash, seed) = tup
self.__del__()
self._objptr = lib.kmerminhash_new(
n, ksize, is_protein, dayhoff, hp, seed, max_hash, track_abundance
)
if track_abundance:
self.set_abundances(mins)
else:
self.add_many(mins)
def __reduce__(self):
"alternative pickling protocol."
return (
MinHash,
(
self.num,
self.ksize,
self.is_protein,
self.dayhoff,
self.hp,
self.track_abundance,
self.seed,
self.max_hash,
self.get_mins(with_abundance=self.track_abundance),
0,
),
)
def __eq__(self, other):
"equality testing via =="
return self.__getstate__() == other.__getstate__()
def copy_and_clear(self):
"Create an empty copy of this MinHash."
a = MinHash(
self.num,
self.ksize,
self.is_protein,
self.dayhoff,
self.hp,
self.track_abundance,
self.seed,
self.max_hash,
)
return a
def add_sequence(self, sequence, force=False):
"Add a sequence into the sketch."
self._methodcall(lib.kmerminhash_add_sequence, to_bytes(sequence),
force)
def add(self, kmer):
"Add a kmer into the sketch."
self.add_sequence(kmer)
def add_many(self, hashes):
"""Add many hashes to the sketch at once.
``hashes`` can be either an iterable (list, set, etc.), or another
``MinHash`` object.
"""
if isinstance(hashes, MinHash):
self._methodcall(lib.kmerminhash_add_from, hashes._objptr)
else:
self._methodcall(lib.kmerminhash_add_many, list(hashes), len(hashes))
def remove_many(self, hashes):
"Remove many hashes at once; ``hashes`` must be an iterable."
self._methodcall(lib.kmerminhash_remove_many, list(hashes), len(hashes))
def update(self, other):
"Update this sketch from all the hashes in the other."
self.add_many(other)
def __len__(self):
"Number of hashes."
return self._methodcall(lib.kmerminhash_get_mins_size)
def get_mins(self, with_abundance=False):
"""Return list of hashes or if ``with_abundance`` a list
of (hash, abund).
"""
size = ffi.new("uintptr_t *")
mins_ptr = self._methodcall(lib.kmerminhash_get_mins, size)
size = size[0]
try:
if with_abundance and self.track_abundance:
size_abunds = ffi.new("uintptr_t *")
abunds_ptr = self._methodcall(lib.kmerminhash_get_abunds, size_abunds)
size_abunds = size_abunds[0]
assert size == size_abunds
result = dict(zip(ffi.unpack(mins_ptr, size), ffi.unpack(abunds_ptr, size)))
lib.kmerminhash_slice_free(abunds_ptr, size)
else:
result = ffi.unpack(mins_ptr, size)
finally:
lib.kmerminhash_slice_free(mins_ptr, size)
return result
def get_hashes(self):
"Return the list of hashes."
return self.get_mins()
def subtract_mins(self, other):
"""Get the list of mins in this MinHash, after removing the ones in
``other``.
"""
a = set(self.get_mins())
b = set(other.get_mins())
return a - b
@property
def seed(self):
return self._methodcall(lib.kmerminhash_seed)
@property
def num(self):
return self._methodcall(lib.kmerminhash_num)
@property
def scaled(self):
if self.max_hash:
return get_scaled_for_max_hash(self.max_hash)
return 0
@property
def is_dna(self):
return not (self.is_protein or self.dayhoff or self.hp)
@property
def is_protein(self):
return self._methodcall(lib.kmerminhash_is_protein)
@property
def dayhoff(self):
return self._methodcall(lib.kmerminhash_dayhoff)
@property
def hp(self):
return self._methodcall(lib.kmerminhash_hp)
@property
def ksize(self):
return self._methodcall(lib.kmerminhash_ksize)
@property
def max_hash(self):
return self._methodcall(lib.kmerminhash_max_hash)
@property
def track_abundance(self):
return self._methodcall(lib.kmerminhash_track_abundance)
@track_abundance.setter
def track_abundance(self, b):
if self.track_abundance == b:
return
if b is False:
self._methodcall(lib.kmerminhash_disable_abundance)
elif len(self) > 0:
raise RuntimeError("Can only set track_abundance=True if the MinHash is empty")
else:
self._methodcall(lib.kmerminhash_enable_abundance)
def add_hash(self, h):
"Add a single hash value."
return self._methodcall(lib.kmerminhash_add_hash, h)
def add_hash_with_abundance(self, h, a):
"Add a single hash value with an abundance."
if self.track_abundance:
return self._methodcall(lib.kmerminhash_add_hash_with_abundance, h, a)
else:
raise RuntimeError(
"Use track_abundance=True when constructing "
"the MinHash to use add_hash_with_abundance."
)
def clear(self):
"Clears all hashes and abundances."
return self._methodcall(lib.kmerminhash_clear)
def translate_codon(self, codon):
"Translate a codon into an amino acid."
try:
return rustcall(lib.sourmash_translate_codon,
to_bytes(codon)).decode('utf-8')
except SourmashError as e:
raise ValueError(e.message)
def count_common(self, other, downsample=False):
"""\
Return the number of hashes in common between ``self`` and ``other``.
Optionally downsample ``scaled`` objects to highest ``scaled`` value.
"""
if not isinstance(other, MinHash):
raise TypeError("Must be a MinHash!")
return self._methodcall(lib.kmerminhash_count_common, other._get_objptr(), downsample)
def downsample_n(self, new_num):
"Copy this object and downsample new object to num=``new_num``."
if self.num and self.num < new_num:
raise ValueError("new sample n is higher than current sample n")
a = MinHash(
new_num, self.ksize, self.is_protein, self.dayhoff, self.hp, self.track_abundance, self.seed, 0
)
if self.track_abundance:
a.set_abundances(self.get_mins(with_abundance=True))
else:
a.add_many(self)
return a
def downsample_max_hash(self, *others):
"""Copy this object and downsample new object to min of ``*others``.
Here, ``*others`` is one or more MinHash objects.
"""
max_hashes = [x.max_hash for x in others]
new_max_hash = min(self.max_hash, *max_hashes)
new_scaled = get_scaled_for_max_hash(new_max_hash)
return self.downsample_scaled(new_scaled)
def downsample_scaled(self, new_scaled):
"""Copy this object and downsample new object to scaled=``new_scaled``.
"""
if self.num:
raise ValueError("num != 0 - cannot downsample a standard MinHash")
max_hash = self.max_hash
if max_hash is None:
raise ValueError("no max_hash available - cannot downsample")
old_scaled = get_scaled_for_max_hash(self.max_hash)
if old_scaled > new_scaled:
raise ValueError(
"new scaled {} is lower than current sample scaled {}".format(
new_scaled, old_scaled
)
)
new_max_hash = get_max_hash_for_scaled(new_scaled)
a = MinHash(
0,
self.ksize,
self.is_protein,
self.dayhoff,
self.hp,
self.track_abundance,
self.seed,
new_max_hash,
)
if self.track_abundance:
a.set_abundances(self.get_mins(with_abundance=True))
else:
a.add_many(self)
return a
@deprecated(deprecated_in="3.3", removed_in="4.0",
current_version=VERSION,
details='Use count_common or set methods instead.')
def intersection(self, other, in_common=False):
"""Calculate the intersection between ``self`` and ``other``, and
return ``(mins, size)`` where ``mins`` are the hashes in common, and
``size`` is the number of hashes.
if ``in_common``, return the actual hashes. Otherwise, mins will be
empty.
"""
if not isinstance(other, MinHash):
raise TypeError("Must be a MinHash!")
if self.num != other.num:
err = "must have same num: {} != {}".format(self.num, other.num)
raise TypeError(err)
if in_common:
# TODO: copy from buffer to Python land instead,
# this way involves more moving data around.
combined_mh = self.copy_and_clear()
combined_mh.merge(self)
combined_mh.merge(other)
size = len(combined_mh)
common = set(self.get_mins())
common.intersection_update(other.get_mins())
else:
size = self._methodcall(lib.kmerminhash_intersection, other._get_objptr())
common = set()
return common, max(size, 1)
def jaccard(self, other, downsample=False):
"Calculate Jaccard similarity of two MinHash objects."
if self.num != other.num:
err = "must have same num: {} != {}".format(self.num, other.num)
raise TypeError(err)
return self._methodcall(lib.kmerminhash_similarity, other._get_objptr(), True, downsample)
@deprecated(deprecated_in="3.3", removed_in="4.0",
current_version=VERSION,
details="Use 'similarity' instead of compare.")
def compare(self, other, downsample=False):
"Calculate Jaccard similarity of two sketches."
return self.jaccard(other, downsample=downsample)
def similarity(self, other, ignore_abundance=False, downsample=False):
"""Calculate similarity of two sketches.
If the sketches are not abundance weighted, or ignore_abundance=True,
compute Jaccard similarity.
If the sketches are abundance weighted, calculate the angular
similarity, a distance metric based on the cosine similarity.
Note, because the term frequencies (tf-idf weights) cannot be negative,
the angle will never be < 0deg or > 90deg.
See https://en.wikipedia.org/wiki/Cosine_similarity
"""
return self._methodcall(lib.kmerminhash_similarity,
other._get_objptr(),
ignore_abundance, downsample)
def angular_similarity(self, other):
"Calculate the angular similarity."
return self._methodcall(lib.kmerminhash_angular_similarity,
other._get_objptr())
def is_compatible(self, other):
return self._methodcall(lib.kmerminhash_is_compatible, other._get_objptr())
def contained_by(self, other, downsample=False):
"""\
Calculate how much of self is contained by other.
"""
if not len(self):
return 0.0
return self.count_common(other, downsample) / len(self)
@deprecated(deprecated_in="3.3", removed_in="4.0",
current_version=VERSION,
details="Use 'contained_by' with downsample=True instead.")
def containment_ignore_maxhash(self, other):
"""Calculate contained_by, with downsampling.
"""
return self.contained_by(other, downsample=True)
def __iadd__(self, other):
if not isinstance(other, MinHash):
raise TypeError("Must be a MinHash!")
self._methodcall(lib.kmerminhash_merge, other._get_objptr())
return self
merge = __iadd__
def set_abundances(self, values, clear=True):
"""Set abundances for hashes from ``values``, where
``values[hash] = abund``
"""
if self.track_abundance:
hashes = []
abunds = []
for h, v in values.items():
hashes.append(h)
abunds.append(v)
self._methodcall(lib.kmerminhash_set_abundances, hashes, abunds, len(hashes), clear)
else:
raise RuntimeError(
"Use track_abundance=True when constructing "
"the MinHash to use set_abundances."
)
def add_protein(self, sequence):
"Add a protein sequence."
self._methodcall(lib.kmerminhash_add_protein, to_bytes(sequence))
def is_molecule_type(self, molecule):
"""Check if this MinHash is a particular human-readable molecule type.
Supports 'protein', 'dayhoff', 'hp', 'DNA'.
@CTB deprecate for 4.0?
"""
if molecule.lower() not in ('protein', 'dayhoff', 'hp', 'dna'):
raise ValueError("unknown moltype in query, '{}'".format(molecule))
return molecule == self.moltype
@property
def moltype(self): # TODO: test in minhash tests
if self.is_protein:
return 'protein'
elif self.dayhoff:
return 'dayhoff'
elif self.hp:
return 'hp'
else:
return 'DNA'