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 | def typing_pipeline(
assembly: str | PathLike | Assembly, db: str | PathLike | Database, threads: int = 0,
score_metric: int = 0, weight_metric: int = 3, min_cov: float = 50, n_best: int = 2,
max_other_genes: int = 1, percent_expected_genes: float = 50, allow_below_threshold: bool = False,
score_file: TextIO = None, verbose: bool = False) -> TypingResult | None:
"""
Performs *in silico* serotyping on a bacterial genome assembly using a database of known loci.
:param assembly: Path to the assembly file or Assembly object
:param db: Path to the database file or Database object
:param threads: Number of threads to use for alignment
:param score_metric: score to use: 0=AS, 1=mlen, 2=blen, 3=q_len
:param weight_metric: Score weighting metric: 0=None, 1=Genes found, 2=Genes expected, 3=Prop genes, 4=blen, 5=q_len
:param min_cov: Minimum coverage for a gene to be used for scoring
:param n_best: Number of top loci from the 1st round of scoring to be fully aligned to the assembly
:param max_other_genes: Max other genes to allow in the best locus to be considered Typeable
:param percent_expected_genes: Percent of expected genes required to be considered Typeable
:param allow_below_threshold: Allow genes below the threshold to be considered Typeable
:param score_file: File handle to write the scores to, will not type the assembly if provided
:param verbose: Print progress to stderr
:return: TypingResult object or None
"""
# CHECK ARGS -------------------------------------------------------------------------------------------------------
if not isinstance(db, Database) and not (db := load_database(db, verbose=verbose)):
return None
if not isinstance(assembly, Assembly) and not (assembly := parse_assembly(assembly, verbose=verbose)):
return None
threads = threads if threads else check_cpus(threads, verbose=verbose)
# ALIGN GENES ------------------------------------------------------------------------------------------------------
# Init scores array with 6 columns: AS, mlen, blen, q_len, genes_found, genes_expected
scores, alignments = np.zeros((len(db), 6)), []
# Group alignments by query gene (Alignment.q)
for q, alns in group_alns(assembly.map(db.format('ffn'), threads, verbose=verbose)):
if q.startswith("Extra_genes"):
alignments.append(max(alns, key=lambda x: x.mlen)) # Add the best alignment for extra genes
else:
alignments.extend(alns := list(alns)) # Add all alignments to the list, convert generator to list too
# Use the best alignment for each gene for scoring, if the coverage is above the minimum
if ((best := max(alns, key=lambda x: x.mlen)).blen / best.q_len) * 100 >= min_cov:
scores[db.loci[q.split('_', 1)[0]].index] += [
best.tags['AS'], best.mlen, best.blen, best.q_len, 1, 0]
# For each gene, add: AS, mlen, blen, q_len, genes_found (1), genes_expected (0 but will update later)
if scores.max() == 0: # If no gene alignments were found, return None so pipeline can continue
return warning(f'No gene alignments sufficient for typing {assembly}\n'
f'Have you used the appropriate database for your species?')
# SCORE LOCI -------------------------------------------------------------------------------------------------------
scores[:, 5] = db.expected_gene_counts # Add expected genes to the 6th column (0-based) score matrix
if score_file: # If we are just scoring the assembly
score_file.write( # Write the scores to the file
''.join([f"{assembly}\t{k}\t" + '\t'.join(map(str, v)) + '\n' for k, v in zip(db.loci.keys(), scores)])
)
return log(f"Finished scoring {assembly}", verbose=verbose) # Return without typing the assembly
# Process the scores to get the best loci to fully align, this collapses the matrix to a 1D array
if weight_metric: # If we are using a weighted score
if weight_metric == 1:
scores = scores[:, score_metric] / scores[:, 4] # Genes found
elif weight_metric == 2:
scores = scores[:, score_metric] / scores[:, 5] # Genes expected
elif weight_metric == 3:
scores = scores[:, score_metric] * (scores[:, 4] / scores[:, 5]) # Prop genes
elif weight_metric == 4:
scores = scores[:, score_metric] / scores[:, 2] # blen
elif weight_metric == 5:
scores = scores[:, score_metric] / scores[:, 3] # q_len
else:
scores = scores[:, score_metric] # Unweighted score
best_loci = [db[int(i)] for i in
np.argsort(scores)[::-1][:min(n_best, len(scores))]] # Get the best loci to fully align
scores, idx = np.zeros((len(best_loci), 4)), {l.name: i for i, l in enumerate(best_loci)} # Init scores and index
locus_alignments = {l.name: [] for l in best_loci} # Init dict to store alignments for each locus
# Group alignments by locus
for locus, alns in group_alns(assembly.map(''.join(i.format('fna') for i in best_loci), threads, verbose=verbose)):
for a in alns: # For each alignment of the locus
scores[idx[locus]] += [a.tags['AS'], a.mlen, a.blen, a.q_len] # Add alignment metrics to the scores
locus_alignments[locus].append(a) # Add the alignment to the locus alignments
best_match = best_loci[np.argmax(scores[:, score_metric])] # Get the best match based on the highest score
# RECONSTRUCT LOCUS ------------------------------------------------------------------------------------------------
result = TypingResult(assembly.name, db, best_match) # Create the result object
pieces = { # Init dict to store pieces for each contig
ctg: [LocusPiece(ctg, result, s, e) for s, e in # Create pieces for each merged contig range
merge_ranges([(a.r_st, a.r_en) for a in alns], len(db.largest_locus))] # Merge ranges by largest locus
for ctg, alns in group_alns(locus_alignments[best_match.name], key='ctg') # Group by contig
} # We can't add strand as the pieces may be merged from multiple alignments, we will determine from the genes
# GET GENE RESULTS -------------------------------------------------------------------------------------------------
for a in cull_filtered(lambda i: i.q in best_match.genes, alignments): # For each non-overlapping gene alignment
if gene := best_match.genes.get(a.q): # Get gene reference from database and gene type
gene_type = "expected_genes"
elif gene := db.extra_genes.get(a.q):
gene_type = "extra_genes"
else:
gene = db.genes.get(a.q)
gene_type = "unexpected_genes"
# Get Piece if gene range overlaps with a piece
piece = next(filter(lambda p: range_overlap((p.start, p.end), (a.r_st, a.r_en)) > 0,
pieces.get(a.ctg, [])), None)
# Create gene result and extract sequence from assembly
gene_result = GeneResult(a.ctg, gene, result, piece, a.r_st, a.r_en, a.strand, gene_type=gene_type,
partial=a.partial, dna_seq=assembly.seq(a.ctg, a.r_st, a.r_en, a.strand))
# Evaluate the gene in protein space by comparing the translation to the reference gene
gene_result.compare_translation(table=11, to_stop=True) # This will also trigger the protein alignment
gene_result.below_threshold = gene_result.percent_identity < db.gene_threshold # Check if below threshold
if not piece and gene_result.below_threshold: # If below protein identity threshold
continue # Skip this gene, probably a homologue in another part of the genome
result.add_gene_result(gene_result) # Add the gene result to the result to get neighbouring genes
# previous_result = gene_result # Set the previous gene result to the current result
# FINALISE PIECES --------------------------------------------------------------------------------------------------
for ctg, pieces in pieces.items(): # Add sequences to pieces and add them to the result
for piece in pieces:
if piece.expected_genes: # If the piece has expected genes
piece.strand = "+" if max(i.strand == i.gene.strand for i in piece.expected_genes) else "-"
# Piece strand is consensus of expected gene strands
piece.sequence = assembly.seq(ctg, piece.start, piece.end, piece.strand)
result.pieces.append(piece) # Add the piece to the result
# FINALISE RESULT -------------------------------------------------------------------------------------------------
# Sort the pieces by the sum of the expected gene order to get the expected order of the pieces
result.pieces.sort(key=lambda x: min(i.gene.start for i in x.expected_genes))
[l.sort(key=lambda x: gene.start) for l in (
result.expected_genes_inside_locus, result.expected_genes_outside_locus, result.unexpected_genes_inside_locus,
result.unexpected_genes_outside_locus)]
result.missing_genes = list(set(best_match.genes) - {
i.gene.name for i in chain(result.expected_genes_inside_locus, result.expected_genes_outside_locus)
})
result.get_confidence(allow_below_threshold, max_other_genes, percent_expected_genes)
log(f"Finished typing {result}", verbose=verbose)
return result
|