/
command_gather.py
276 lines (220 loc) · 9.56 KB
/
command_gather.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
#! /usr/bin/env python
"""
Execute a greedy search on lineages attached to hashvals in the query.
Mimics `sourmash gather` but provides taxonomic information.
"""
from __future__ import print_function, division
import sys
import csv
from collections import Counter, defaultdict, namedtuple
from .. import sourmash_args, save_signatures, SourmashSignature
from ..logging import notify, print_results, set_quiet, debug
from . import lca_utils
from .lca_utils import check_files_exist
from ..search import format_bp
LCAGatherResult = namedtuple('LCAGatherResult',
'intersect_bp, f_unique_to_query, f_unique_weighted, average_abund, lineage, f_match, name, n_equal_matches')
def format_lineage(lineage_tup):
"""
Pretty print lineage.
"""
# list of ranks present
present = [ l.rank for l in lineage_tup if l.name ]
d = dict(lineage_tup) # rank: value
if 'genus' in present:
genus = d['genus']
if 'strain' in present:
name = d['strain']
elif 'species' in present:
species = d['species']
if species.startswith(genus + ' ') or \
species.startswith(genus + '_'):
name = species
else:
name = '{} {}'.format(genus, species)
else:
name = '{} sp.'.format(genus)
elif len(present) < 3:
lineage_str = lca_utils.zip_lineage(lineage_tup, truncate_empty=True)
lineage_str = "; ".join(lineage_str)
name = lineage_str + ' - (no further assignment)'
elif len(present) > 1 and 'superkingdom' in present:
lowest_rank = present[-1]
name = '{}; {} {}'.format(d['superkingdom'], lowest_rank,
d[lowest_rank])
else:
lineage_str = lca_utils.zip_lineage(lineage_tup, truncate_empty=True)
lineage_str = "; ".join(lineage_str)
name = lineage_str
return name
def gather_signature(query_sig, dblist, ignore_abundance):
"""
Decompose 'query_sig' using the given list of databases.
"""
notify('loaded query: {}... (k={})', query_sig.name()[:30],
query_sig.minhash.ksize)
# extract the basic set of mins
query_mins = set(query_sig.minhash.get_mins())
n_mins = len(query_mins)
if query_sig.minhash.track_abundance and not ignore_abundance:
orig_abunds = query_sig.minhash.get_mins(with_abundance=True)
else:
if query_sig.minhash.track_abundance and ignore_abundance:
notify('** ignoring abundance')
orig_abunds = { k: 1 for k in query_mins }
sum_abunds = sum(orig_abunds.values())
# now! do the gather:
while 1:
# find all of the assignments for the current set of hashes
assignments = defaultdict(set)
for hashval in query_mins:
for lca_db in dblist:
idx_list = lca_db.hashval_to_idx.get(hashval, [])
for idx in idx_list:
assignments[hashval].add((lca_db, idx))
# none? quit.
if not assignments:
break
# count the distinct signatures.
counts = Counter()
for hashval, match_set in assignments.items():
for (lca_db, idx) in match_set:
counts[(lca_db, idx)] += 1
# collect the most abundant assignments
best_list = []
top_count = 0
for (lca_db, idx), count in counts.most_common():
if not best_list:
top_count = count
best_list.append((lca_db, idx))
continue
if count != top_count:
break
best_list.append((lca_db, idx))
# sort on idx and pick the lowest (for consistency).
best_list.sort(key=lambda x: x[1])
best_lca_db, best_idx = best_list[0]
equiv_counts = len(best_list) - 1
# now, remove hashes from query mins.
intersect_mins = set()
for hashval, match_set in assignments.items():
if (best_lca_db, best_idx) in match_set:
query_mins.remove(hashval)
intersect_mins.add(hashval)
# should match!
assert top_count == len(intersect_mins)
# calculate size of match (# of hashvals belonging to that sig)
match_size = 0
for hashval, idx_list in best_lca_db.hashval_to_idx.items():
if best_idx in idx_list:
match_size += 1
# construct 'result' object
intersect_bp = top_count * query_sig.minhash.scaled
f_unique_weighted = sum((orig_abunds[k] for k in intersect_mins)) \
/ sum_abunds
average_abund = sum((orig_abunds[k] for k in intersect_mins)) \
/ len(intersect_mins)
f_match = len(intersect_mins) / match_size
# XXX name and lineage
for ident, idx in best_lca_db.ident_to_idx.items():
if idx == best_idx:
name = best_lca_db.ident_to_name[ident]
lid = best_lca_db.idx_to_lid.get(best_idx)
lineage = ()
if lid is not None:
lineage = best_lca_db.lid_to_lineage[lid]
result = LCAGatherResult(intersect_bp = intersect_bp,
f_unique_to_query= top_count / n_mins,
f_unique_weighted=f_unique_weighted,
average_abund=average_abund,
f_match=f_match,
lineage=lineage,
name=name,
n_equal_matches=equiv_counts)
f_unassigned = len(query_mins) / n_mins
est_bp = len(query_mins) * query_sig.minhash.scaled
yield result, f_unassigned, est_bp, query_mins
## done.
def gather_main(args):
"""
Do a greedy search for the hash components of a query against an LCA db.
Here we don't actually do a least-common-ancestor search of any kind; we
do essentially the same kind of search as we do in `sourmash gather`, with
the main difference that we are implicitly combining different genomes of
identical lineages.
This takes advantage of the structure of the LCA db, where we store the
full lineage information for each known hash, as opposed to storing only
the least-common-ancestor information for it.
"""
set_quiet(args.quiet, args.debug)
if not check_files_exist(args.query, *args.db):
sys.exit(-1)
# load all the databases
dblist, ksize, scaled = lca_utils.load_databases(args.db, None)
# for each query, gather all the matches across databases
query_sig = sourmash_args.load_query_signature(args.query, ksize, 'DNA')
debug('classifying', query_sig.name())
# make sure we're looking at the same scaled value as database
query_sig.minhash = query_sig.minhash.downsample_scaled(scaled)
# do the classification, output results
found = []
for result, f_unassigned, est_bp, remaining_mins in gather_signature(query_sig, dblist, args.ignore_abundance):
# is this our first time through the loop? print headers, if so.
if not len(found):
print_results("")
print_results("overlap p_query p_match ")
print_results("--------- ------- --------")
# output!
pct_query = '{:.1f}%'.format(result.f_unique_to_query*100)
pct_match = '{:.1f}%'.format(result.f_match*100)
str_bp = format_bp(result.intersect_bp)
name = format_lineage(result.lineage)
equal_match_str = ""
if result.n_equal_matches:
equal_match_str = " (** {} equal matches)".format(result.n_equal_matches)
print_results('{:9} {:>6} {:>6} {}{}', str_bp, pct_query,
pct_match, name, equal_match_str)
found.append(result)
if found:
print_results('')
if f_unassigned:
print_results('{:.1f}% ({}) of hashes have no assignment.', f_unassigned*100,
format_bp(est_bp))
else:
print_results('Query is completely assigned.')
print_results('')
# nothing found.
else:
est_bp = len(query_sig.minhash.get_mins()) * query_sig.minhash.scaled
print_results('')
print_results('No assignment for est {} of sequence.',
format_bp(est_bp))
print_results('')
if not found:
sys.exit(0)
if args.output:
fieldnames = ['intersect_bp', 'f_match', 'f_unique_to_query', 'f_unique_weighted',
'average_abund', 'name', 'n_equal_matches'] + list(lca_utils.taxlist())
with sourmash_args.FileOutput(args.output, 'wt') as csv_fp:
w = csv.DictWriter(csv_fp, fieldnames=fieldnames)
w.writeheader()
for result in found:
lineage = result.lineage
d = dict(result._asdict())
del d['lineage']
for (rank, value) in lineage:
d[rank] = value
w.writerow(d)
if args.output_unassigned:
if not found:
notify('nothing found - entire query signature unassigned.')
elif not remaining_mins:
notify('no unassigned hashes! not saving.')
else:
notify('saving unassigned hashes to "{}"', args.output_unassigned)
e = query_sig.minhash.copy_and_clear()
e.add_many(remaining_mins)
with sourmash_args.FileOutput(args.output_unassigned, 'wt') as fp:
save_signatures([ SourmashSignature(e) ], fp)
if __name__ == '__main__':
sys.exit(gather_main(sys.argv[1:]))