-
Notifications
You must be signed in to change notification settings - Fork 190
/
QueryMatcher.h
300 lines (247 loc) · 10.6 KB
/
QueryMatcher.h
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
//
// Created by mad on 5/26/15.
//
#ifndef MMSEQS_QUERYTEMPLATEMATCHEREXACTMATCH_H
#define MMSEQS_QUERYTEMPLATEMATCHEREXACTMATCH_H
#include <cstdlib>
#include "itoa.h"
#include "EvalueComputation.h"
#include "CacheFriendlyOperations.h"
#include "UngappedAlignment.h"
#include "KmerGenerator.h"
struct statistics_t{
double kmersPerPos;
size_t dbMatches;
size_t doubleMatches;
size_t querySeqLen;
size_t diagonalOverflow;
size_t resultsPassedPrefPerSeq;
statistics_t() : kmersPerPos(0.0) , dbMatches(0) , doubleMatches(0), querySeqLen(0), diagonalOverflow(0), resultsPassedPrefPerSeq(0) {};
statistics_t(double kmersPerPos, size_t dbMatches,
size_t doubleMatches, size_t querySeqLen, size_t diagonalOverflow, size_t resultsPassedPrefPerSeq) : kmersPerPos(kmersPerPos),
dbMatches(dbMatches),
doubleMatches(doubleMatches),
querySeqLen(querySeqLen),
diagonalOverflow(diagonalOverflow),
resultsPassedPrefPerSeq(resultsPassedPrefPerSeq){};
};
struct hit_t {
unsigned int seqId;
float pScore;
unsigned short diagonal;
unsigned short prefScore;
static bool compareHitsByPValueAndId(hit_t first, hit_t second){
if(first.pScore > second.pScore )
return true;
if(second.pScore > first.pScore )
return false;
if(first.seqId < second.seqId )
return true;
if(second.seqId < first.seqId )
return false;
return false;
}
static bool compareHitsByEValueAndId(hit_t first, hit_t second){
if(first.pScore > second.pScore )
return true;
if(second.pScore > first.pScore )
return false;
if(first.seqId < second.seqId )
return true;
if(second.seqId < first.seqId )
return false;
return false;
}
static bool compareHitsByDiagonalScore(hit_t first, hit_t second){
return (first.prefScore > second.prefScore) ? true : false;
}
static bool compareHitsByEvalue(hit_t first, hit_t second){
return (first.pScore < second.pScore) ? true : false;
}
};
class QueryMatcher {
public:
QueryMatcher(IndexTable *indexTable, SequenceLookup *sequenceLookup,
BaseMatrix *kmerSubMat, BaseMatrix *ungappedAlignmentSubMat,
EvalueComputation &evaluer, unsigned int *seqLens, short kmerThr,
double kmerMatchProb, int kmerSize, size_t dbSize,
unsigned int maxSeqLen, unsigned int effectiveKmerSize,
size_t maxHitsPerQuery, bool aaBiasCorrection, bool diagonalScoring,
unsigned int minDiagScoreThr, bool takeOnlyBestKmer,size_t resListOffset);
~QueryMatcher();
// returns result for the sequence
// identityId is the id of the identitical sequence in the target database if there is any, UINT_MAX otherwise
std::pair<hit_t *, size_t> matchQuery(Sequence * querySeq, unsigned int identityId);
// find duplicates in the diagonal bins
size_t evaluateBins(IndexEntryLocal **hitsByIndex, CounterResult *output,
size_t outputSize, unsigned short indexFrom, unsigned short indexTo, bool computeTotalScore);
void updateScoreBins(CounterResult *result, size_t elementCount);
// set substituion matrix for KmerGenerator
void setProfileMatrix(ScoreMatrix **matrix){
this->kmerGenerator->setDivideStrategy(matrix );
}
// set substitution matrix
void setSubstitutionMatrix(ScoreMatrix * three, ScoreMatrix * two) {
this->kmerGenerator->setDivideStrategy(three, two );
}
// get statistics
const statistics_t * getStatistics(){
return stats;
}
const static size_t SCORE_RANGE = 256;
static unsigned int computeScoreThreshold(unsigned int * scoreSizes, size_t maxHitsPerQuery) {
size_t foundHits = 0;
size_t scoreThr = 0;
for(scoreThr = SCORE_RANGE - 1; scoreThr > 0 ; scoreThr--){
foundHits += scoreSizes[scoreThr];
if(foundHits >= maxHitsPerQuery)
break;
}
return scoreThr;
}
// compute -log(p)
static inline double computeLogProbability(const unsigned short rawScore, const unsigned int dbSeqLen,
const double kmerMatchProb, const double logMatchProb,
const double logScoreFactorial) {
const double score = static_cast<double>(rawScore);
const double dbSeqLenDbl = static_cast<double>(dbSeqLen);
const double mu = kmerMatchProb * dbSeqLenDbl;
const double mid_term = score * (logMatchProb + log(dbSeqLenDbl));
const double first_term = -(mu * score /(score + 1));
return first_term + mid_term - logScoreFactorial;
}
static hit_t parsePrefilterHit(char* data)
{
hit_t result;
char *wordCnt[255];
size_t cols = Util::getWordsOfLine(data, wordCnt, 254);
if (cols>=3)
{
result.seqId = Util::fast_atoi<unsigned int>(wordCnt[0]);
result.pScore = static_cast<float>(Util::fast_atoi<int>(wordCnt[1]));
result.diagonal = static_cast<unsigned short>(Util::fast_atoi<short>(wordCnt[2]));
} else { //error
result.seqId = -1;
result.pScore = -1;
result.diagonal = -1;
}
return result;
}
static std::vector<hit_t> parsePrefilterHits(char *data) {
std::vector<hit_t> ret;
while (*data != '\0') {
hit_t result = parsePrefilterHit(data);
ret.push_back(result);
data = Util::skipLine(data);
}
return ret;
}
static size_t prefilterHitToBuffer(char *buff1, hit_t &h)
{
char * basePos = buff1;
char * tmpBuff = Itoa::u32toa_sse2((uint32_t) h.seqId, buff1);
*(tmpBuff-1) = '\t';
int score = static_cast<int>(h.pScore);
tmpBuff = Itoa::i32toa_sse2(score, tmpBuff);
*(tmpBuff-1) = '\t';
int32_t diagonal = static_cast<short>(h.diagonal);
tmpBuff = Itoa::i32toa_sse2(diagonal, tmpBuff);
*(tmpBuff-1) = '\n';
*(tmpBuff) = '\0';
return tmpBuff - basePos;
}
protected:
// keeps stats for run
statistics_t * stats;
// scoring matrix for local amino acid bias correction
BaseMatrix * kmerSubMat;
// scoring matrix for ungapped alignment
BaseMatrix * ungappedAlignmentSubMat;
/* generates kmer lists */
KmerGenerator * kmerGenerator;
/* contains the sequences for a kmer */
IndexTable * indexTable;
// k of the k-mer
int kmerSize;
// local amino acid bias correction
bool aaBiasCorrection;
// take only best kmer
bool takeOnlyBestKmer;
// kmer threshold for kmer generator
short kmerThr;
unsigned int maxDbMatches;
unsigned int dbSize;
// result hit buffer
//CacheFriendlyOperations * diagonalMatcher;
unsigned int activeCounter;
#define CacheFriendlyOperations(x) CacheFriendlyOperations<x> * cachedOperation##x
CacheFriendlyOperations(2);
CacheFriendlyOperations(4);
CacheFriendlyOperations(8);
CacheFriendlyOperations(16);
CacheFriendlyOperations(32);
CacheFriendlyOperations(64);
CacheFriendlyOperations(128);
CacheFriendlyOperations(256);
CacheFriendlyOperations(512);
CacheFriendlyOperations(1024);
CacheFriendlyOperations(2048);
#undef CacheFriendlyOperations
// matcher for diagonal
UngappedAlignment *ungappedAlignment;
// score distribution of current query
unsigned int *scoreSizes;
// result hit buffer
hit_t *resList;
// i position to hits pointer
IndexEntryLocal **indexPointer;
// keeps data in inner loop
IndexEntryLocal * __restrict databaseHits;
// evaluated bins
CounterResult * foundDiagonals;
// last data pointer (for overflow check)
IndexEntryLocal * lastSequenceHit;
// the following variables are needed to calculate the Z-score computation
double mu;
//log match prob (mu) of poisson distribution
double logMatchProb;
// evaluer
EvalueComputation evaluer;
//pre computed score factorials
// S_fact = score!
double *logScoreFactorial;
// max seq. per query
size_t maxHitsPerQuery;
// offset in the result list
size_t resListOffset;
//pointer to seqLens
float *seqLens;
// match sequence against the IndexTable
size_t match(Sequence *seq, float *pDouble);
// extract result from databaseHits
std::pair<hit_t *, size_t> getResult(CounterResult * results,
size_t resultSize,
size_t maxHitPerQuery,
const int queryLen, const unsigned int id,
const unsigned short thr,
UngappedAlignment *ungappedAlignment,
const bool diagonalScoring, const int rescale);
// compute double hits
size_t getDoubleDiagonalMatches();
float *compositionBias;
// diagonal scoring active
bool diagonalScoring;
unsigned int minDiagScoreThr;
// size of max diagonalMatcher result objects
size_t counterResultSize;
void initDiagonalMatcher(size_t dbsize, unsigned int maxDbMatches);
void deleteDiagonalMatcher(unsigned int activeCounter);
size_t mergeElements(bool diagonalScoring, CounterResult *foundDiagonals, size_t hitCounter);
size_t keepMaxScoreElementOnly(CounterResult *foundDiagonals, size_t resultSize);
size_t radixSortByScoreSize(const unsigned int *scoreSizes,
CounterResult *writePos, const unsigned int scoreThreshold,
const CounterResult *results, const size_t resultSize);
std::pair<size_t, unsigned int> rescoreHits(Sequence * querySeq, unsigned int *scoreSizes, CounterResult *results,
size_t resultSize, UngappedAlignment *align, int lowerBoundScore);
};
#endif //MMSEQS_QUERYTEMPLATEMATCHEREXACTMATCH_H