forked from ncbi/amr
-
Notifications
You must be signed in to change notification settings - Fork 0
/
alignment.hpp
332 lines (279 loc) · 9.3 KB
/
alignment.hpp
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
// alignment.hpp
/*===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyright Act. It was written as part of
* the author's official duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================
*
* Author: Vyacheslav Brover
*
* File Description:
* Protein or DNA mutations library.
*
*/
#include "common.hpp"
using namespace Common_sp;
namespace Alignment_sp
{
static constexpr char pm_delimiter = '_';
struct AmrMutation : Root
// Database
{
size_t pos {0};
// In whole reference sequence
// = start of reference
// !empty()
string geneMutation;
string classS;
string subclass;
string name;
// Species binomial + resistance
// Function of geneMutation_arg
// Upper-case
string reference;
string allele;
string gene;
int ref_pos {0};
size_t frameshift {no_index};
// Position of '*' after getStop()
int frameshift_insertion {0};
AmrMutation (size_t pos_arg,
const string &geneMutation_arg,
const string &class_arg = "X",
const string &subclass_arg = "X",
const string &name_arg = "X");
// Input: pos_arg: 1-based
AmrMutation () = default;
AmrMutation (AmrMutation &&other) = default;
AmrMutation& operator= (const AmrMutation &other) = default;
AmrMutation& operator= (AmrMutation &&other) = default;
private:
static void parse (string &geneMutation,
string &reference,
string &allele,
string &gene,
int &ref_pos,
size_t &frameshift,
int &frameshift_insertion);
public:
void qc () const override;
void saveText (ostream &os) const override
{ if (empty ())
os << "empty";
else
os << pos + 1 << ' ' << geneMutation << ' ' << frameshift_insertion << ' ' << name;
}
bool empty () const override
{ return geneMutation. empty (); }
size_t getStop () const
{ return pos + reference. size (); }
string wildtype () const
{ return gene + "_" + reference + to_string (ref_pos + 1) + reference; }
bool operator< (const AmrMutation &other) const;
bool operator== (const AmrMutation &other) const
{ return geneMutation == other. geneMutation; }
void apply (string &seq) const
{ if (pos >= seq. size ())
throw runtime_error ("AmrMutation position " + to_string (pos) + " is outside the sequence: " + seq);
if (frameshift != no_index)
throw runtime_error ("AmrMutation is a frameshift");
if (verbose ())
cerr << seq. substr (0, pos)
<< endl << allele
<< endl << seq. substr (pos + reference. size ())
<< endl;
seq = seq. substr (0, pos) + allele + seq. substr (pos + reference. size ());
}
};
struct Alignment;
struct SeqChange : Root
// Observation
{
const Alignment* al {nullptr};
// !nullptr
bool fromAllele {false};
// In alignment
size_t start {0};
size_t len {0};
// No '-'
string reference;
// Insertion => !empty() by artifically decrementing start and incrementing len
string allele;
size_t start_ref {0};
size_t stop_ref {0};
size_t start_target {0};
double neighborhoodMismatch {0.0};
// 0..1
VectorPtr<AmrMutation> mutations;
// !nullptr
const SeqChange* replacement {nullptr};
// !nullptr => *this is replaced by *replacement
SeqChange () = default;
SeqChange (const Alignment* al_arg,
bool fromAllele_arg)
: al (al_arg)
, fromAllele (fromAllele_arg)
{}
SeqChange (const Alignment* al_arg,
const AmrMutation* mutation_arg)
: al (al_arg)
{ mutations << checkPtr (mutation_arg); }
void qc () const override;
void saveText (ostream &os) const override
{ os << start + 1
<< ' ' << len
<< ' ' << strQuote (reference) << " -> " << strQuote (allele)
<< ' ' << start_ref + 1 << ".." << stop_ref
<< ' ' << start_target + 1
<< ' ' << neighborhoodMismatch;
for (const AmrMutation* mutation : mutations)
{ os << ' ' ;
mutation->saveText (os);
}
os << endl;
}
bool empty () const override
{ return ! len; }
bool hasMutation () const
{ return ! empty () && ! mutations. empty () && ! replacement; }
bool hasFrameshift () const
{ return hasMutation () && mutations [0] -> frameshift != no_index; }
string getMutationStr () const;
size_t getStop () const
{ return start + len; }
bool operator< (const SeqChange &other) const;
bool better (const SeqChange &other) const;
bool finish (const string &refSeq,
size_t flankingLen);
// Return: good match
// Invokes: finishPos()
bool finishPos (size_t flankingLen);
// Return: good match
private:
void setSeq ();
void setStartStopRef ();
void setStartTarget ();
void setNeighborhoodMismatch (size_t flankingLen);
public:
bool matchesMutation (const AmrMutation& mut) const;
};
void normalizeSeqs (string &seq1,
string &seq2);
struct Alignment : Root
// No TBLASTX
{
// Positions are 0-based
// start < end <= len
// BLAST query
bool targetProt {false};
// false <=> DNA
string targetName;
string targetSeq;
// Uppercase
size_t targetStart {0};
size_t targetEnd {0};
size_t targetLen {0};
bool targetStrand {true};
// false <=> negative
// BLAST subject
bool refProt {false};
// false <=> DNA
string refName;
string refSeq;
// Uppercase
size_t refStart {0};
size_t refEnd {0};
size_t refLen {0};
AmrMutation refMutation;
// !empty() => refSeq is an allele
//int ref_offset {0};
// Alignment
bool alProt {false};
size_t nident {0};
size_t al2ref_len {1};
size_t al2target_len {1};
Vector<SeqChange> seqChanges;
Alignment (const string &line,
bool targetProt_arg,
bool refProt_arg);
static constexpr const char* format {"qseqid sseqid qstart qend qlen sstart send slen sseq"};
// 1-based
Alignment () = default;
private:
void set_nident ();
// Output: nident
protected:
void setSeqChanges (const Vector<AmrMutation> &refMutations,
size_t flankingLen/*,
bool allMutationsP*/);
// Input: flankingLen: valid if > 0
private:
size_t refMutation2refSeq_pos ();
// Return: no_index <=> refMutation is not detected
public:
bool empty () const override
{ return targetName. empty (); }
void qc () const override;
void saveText (ostream &os) const override
{ os << targetProt
<< '\t' << targetName
<< '\t' << targetStart
<< '\t' << targetEnd
<< '\t' << targetLen
<< '\t' << targetStrand
<< '\t' << refName
<< '\t' << refStart
<< '\t' << refEnd
<< '\t' << refLen
<< '\t' << nident
<< '\t' << targetSeq
<< '\t' << refSeq
<< endl;
if (! refMutation. empty ())
os << refMutation << endl;
os << "# Mutations: " << seqChanges. size () << endl;
}
bool hasMutation () const
{ for (const SeqChange& seqChange : seqChanges)
if (seqChange. hasMutation ())
return true;
return false;
}
bool hasFrameshift () const
{ return seqChanges. size () == 1 && seqChanges [0]. hasFrameshift (); }
double pIdentity () const
{ return (double) nident / (double) targetSeq. size (); }
double refCoverage () const
{ return (double) (refEnd - refStart) / (double) refLen; }
double targetCoverage () const
{ return targetProt ? (double) (targetEnd - targetStart) / (double) targetLen : NaN; }
size_t targetTail (bool upstream) const
{ return targetStrand == upstream ? targetStart : (targetLen - targetEnd); }
bool refExactlyMatched () const
{ return refProt
&& refLen
&& nident == refLen
&& nident == targetSeq. size ();
}
long getGlobalTargetStart () const;
// Requires: !targetProt, refProt
};
} // namespace