-
Notifications
You must be signed in to change notification settings - Fork 67
/
IntersectingPairedEndAligner.h
770 lines (660 loc) · 35 KB
/
IntersectingPairedEndAligner.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
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
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
/*++
Module Name:
IntersectingPairedEndAligner.h
Abstract:
A paired-end aligner based on set intersections to narrow down possible candidate locations.
Authors:
Bill Bolosky, February, 2013
Environment:
User mode service.
Revision History:
--*/
#pragma once
#include "PairedEndAligner.h"
#include "BaseAligner.h"
#include "BigAlloc.h"
#include "directions.h"
#include "LandauVishkin.h"
#include "FixedSizeMap.h"
#include "AlignmentAdjuster.h"
#include "AlignerOptions.h"
const unsigned DEFAULT_INTERSECTING_ALIGNER_MAX_HITS = 4000;
const unsigned DEFAULT_MAX_CANDIDATE_POOL_SIZE = 1000000;
class IntersectingPairedEndAligner : public PairedEndAligner
{
public:
IntersectingPairedEndAligner(
GenomeIndex *index_,
unsigned maxReadSize_,
unsigned maxHits_,
unsigned maxK_,
unsigned maxKForIndels_,
unsigned maxSeedsFromCommandLine_,
double seedCoverage_,
int minSpacing_, // Minimum distance to allow between the two ends.
unsigned maxSpacing_, // Maximum distance to allow between the two ends.
unsigned maxBigHits_,
unsigned extraSearchDepth_,
unsigned maxCandidatePoolSize,
int maxSecondaryAlignmentsPerContig_,
BigAllocator *allocator,
bool noUkkonen_,
bool noOrderedEvaluation_,
bool noTruncation_,
bool useAffineGap_,
bool ignoreAlignmentAdjustmentsForOm_,
bool altAwareness_,
unsigned maxScoreGapToPreferNonAltAlignment_,
unsigned matchReward_,
unsigned subPenalty_,
unsigned gapOpenPenalty_,
unsigned gapExtendPenalty,
bool useSoftClip_);
void setLandauVishkin(
LandauVishkin<1> *landauVishkin_,
LandauVishkin<-1> *reverseLandauVishkin_)
{
landauVishkin = landauVishkin_;
reverseLandauVishkin = reverseLandauVishkin_;
}
void setAffineGap(
AffineGapVectorized<1> *affineGap_,
AffineGapVectorized<-1> *reverseAffineGap_)
// AffineGap<1> *affineGap_,
// AffineGap<-1> *reverseAffineGap_)
{
affineGap = affineGap_;
reverseAffineGap = reverseAffineGap_;
}
virtual ~IntersectingPairedEndAligner();
virtual bool align(
Read *read0,
Read *read1,
PairedAlignmentResult* result,
PairedAlignmentResult* firstALTResult,
int maxEditDistanceForSecondaryResults,
_int64 secondaryResultBufferSize,
_int64 *nSecondaryResults,
PairedAlignmentResult *secondaryResults, // The caller passes in a buffer of secondaryResultBufferSize and it's filled in by align()
_int64 singleSecondaryBufferSize,
_int64 maxSecondaryResultsToReturn,
_int64 *nSingleEndSecondaryResultsForFirstRead,
_int64 *nSingleEndSecondaryResultsForSecondRead,
SingleAlignmentResult *singleEndSecondaryResults, // Single-end secondary alignments for when the paired-end alignment didn't work properly
_int64 maxLVCandidatesForAffineGapBufferSize,
_int64 *nLVCandidatesForAffineGap,
PairedAlignmentResult *lvCandidatesForAffineGap, // Landau-Vishkin candidates that need to be rescored using affine gap
_int64 maxSingleCandidatesForAffineGapBufferSize,
_int64 *nSingleCandidatesForAffineGapFirstRead,
_int64 *nSingleCandidatesForAffineGapSecondRead,
SingleAlignmentResult *singleCandidatesForAffineGap,
int maxK_
);
bool alignLandauVishkin(
Read *read0,
Read *read1,
PairedAlignmentResult* result,
PairedAlignmentResult* firstALTResult,
int maxEditDistanceForSecondaryResults,
_int64 secondaryResultBufferSize,
_int64 *nSecondaryResults,
PairedAlignmentResult *secondaryResults, // The caller passes in a buffer of secondaryResultBufferSize and it's filled in by align()
_int64 singleSecondaryBufferSize,
_int64 maxSecondaryResultsToReturn,
_int64 *nSingleEndSecondaryResultsForFirstRead,
_int64 *nSingleEndSecondaryResultsForSecondRead,
SingleAlignmentResult *singleEndSecondaryResults, // Single-end secondary alignments for when the paired-end alignment didn't work properly
_int64 maxLVCandidatesForAffineGapBufferSize,
_int64 *nLVCandidatesForAffineGap,
PairedAlignmentResult *lvCandidatesForAffineGap
);
bool alignHamming(
Read* read0,
Read* read1,
PairedAlignmentResult* result,
PairedAlignmentResult* firstALTResult,
int maxEditDistanceForSecondaryResults,
_int64 secondaryResultBufferSize,
_int64* nSecondaryResults,
PairedAlignmentResult* secondaryResults, // The caller passes in a buffer of secondaryResultBufferSize and it's filled in by align()
_int64 singleSecondaryBufferSize,
_int64 maxSecondaryResultsToReturn,
_int64* nSingleEndSecondaryResultsForFirstRead,
_int64* nSingleEndSecondaryResultsForSecondRead,
SingleAlignmentResult* singleEndSecondaryResults, // Single-end secondary alignments for when the paired-end alignment didn't work properly
_int64 maxLVCandidatesForAffineGapBufferSize,
_int64* nLVCandidatesForAffineGap,
PairedAlignmentResult* lvCandidatesForAffineGap
);
bool alignAffineGap(
Read *read0,
Read *read1,
PairedAlignmentResult* result,
PairedAlignmentResult* firstALTResult,
int maxEditDistanceForSecondaryResults,
_int64 secondaryResultBufferSize,
_int64 *nSecondaryResults,
PairedAlignmentResult *secondaryResults, // The caller passes in a buffer of secondaryResultBufferSize and it's filled in by align()
_int64 singleSecondaryBufferSize,
_int64 maxSecondaryResultsToReturn,
_int64 *nSingleEndSecondaryResultsForFirstRead,
_int64 *nSingleEndSecondaryResultsForSecondRead,
SingleAlignmentResult *singleEndSecondaryResults, // Single-end secondary alignments for when the paired-end alignment didn't work properly
_int64 maxLVCandidatesForAffineGapBufferSize,
_int64 *nLVCandidatesForAffineGap,
PairedAlignmentResult *lvCandidatesForAffineGap
);
static size_t getBigAllocatorReservation(GenomeIndex * index, unsigned maxBigHitsToConsider, unsigned maxReadSize, unsigned seedLen, unsigned maxSeedsFromCommandLine,
double seedCoverage, unsigned maxEditDistanceToConsider, unsigned maxExtraSearchDepth, unsigned maxCandidatePoolSize,
int maxSecondaryAlignmentsPerContig);
void *operator new(size_t size, BigAllocator *allocator) {_ASSERT(size == sizeof(IntersectingPairedEndAligner)); return allocator->allocate(size);}
void operator delete(void *ptr, BigAllocator *allocator) {/* do nothing. Memory gets cleaned up when the allocator is deleted.*/}
void *operator new(size_t size) {return BigAlloc(size);}
void operator delete(void *ptr) {BigDealloc(ptr);}
virtual _int64 getLocationsScored() const {
return nLocationsScored;
}
void setMinSpacing(int minSpacing_) {
minSpacing = minSpacing_;
}
void setMaxSpacing(int maxSpacing_) {
maxSpacing = maxSpacing_;
}
private:
IntersectingPairedEndAligner() : alignmentAdjuster(NULL) {} // This is for the counting allocator, it doesn't build a useful object
static const int NUM_SET_PAIRS = 2; // A "set pair" is read0 FORWARD + read1 RC, or read0 RC + read1 FORWARD. Again, it doesn't make sense to change this.
void allocateDynamicMemory(BigAllocator *allocator, unsigned maxReadSize, unsigned maxBigHitsToConsider, unsigned maxSeedsToUse,
unsigned maxEditDistanceToConsider, unsigned maxExtraSearchDepth, unsigned maxCandidatePoolSize,
int maxSecondaryAlignmentsPerContig);
GenomeIndex * index;
const Genome * genome;
GenomeDistance genomeSize;
unsigned maxReadSize;
unsigned maxHits;
unsigned maxBigHits;
int extraSearchDepth;
int maxK;
int maxKForIndels;
unsigned numSeedsFromCommandLine;
double seedCoverage;
static const unsigned MAX_MAX_SEEDS = 30;
int minSpacing;
unsigned maxSpacing;
unsigned seedLen;
bool doesGenomeIndexHave64BitLocations;
_int64 nLocationsScored;
bool noUkkonen;
bool noOrderedEvaluation;
bool noTruncation;
bool useAffineGap;
bool ignoreAlignmentAdjustmentsForOm;
bool altAwareness;
bool useSoftClip;
int maxScoreGapToPreferNonAltAlignment;
int minBigIndelSize; // We only see indels of this size or bigger if they're hinted by seed hits.
// Affine gap scoring parameters
int matchReward;
int subPenalty;
int gapOpenPenalty;
int gapExtendPenalty;
AlignmentAdjuster alignmentAdjuster;
static const unsigned maxMergeDistance;
//
// It's a template, because we
// have different sizes of genome locations depending on the hash table format. So, GL must be unsigned or GenomeLocation
//
template<class GL> struct HashTableLookup {
unsigned seedOffset;
_int64 nHits;
const GL * hits;
unsigned whichDisjointHitSet;
//
// We keep the hash table lookups that haven't been exhaused in a circular list.
//
HashTableLookup<GL> *nextLookupWithRemainingMembers;
HashTableLookup<GL> *prevLookupWithRemainingMembers;
//
// State for handling the binary search of a location in this lookup.
// This would ordinarily be stack local state in the binary search
// routine, but because a) we want to interleave the steps of the binary
// search in order to allow cache prefetches to have time to execute;
// and b) we don't want to do dynamic memory allocation (really at all),
// it gets stuck here.
//
int limit[2]; // The upper and lower limits of the current binary search in hits
GL maxGenomeLocationToFindThisSeed;
//
// A linked list of lookups that haven't yet completed this binary search. This is a linked
// list with no header element, so testing for emptiness needs to happen at removal time.
// It's done that way to avoid a comparison for list head that would result in a hard-to-predict
// branch.
//
HashTableLookup<GL> *nextLookupForCurrentBinarySearch;
HashTableLookup<GL> *prevLookupForCurrentBinarySearch;
_int64 currentHitForIntersection;
//
// A place for the hash table to write in singletons. We need this because when the hash table is
// built with > 4 byte genome locations, it usually doesn't store 8 bytes, so we need to
// provide the lookup function a place to write the result. Since we need one per
// lookup, it goes here.
//
GL singletonGenomeLocation[2]; // The [2] is because we need to look one before sometimes, and that allows space
}; // HashTableLookup
//
// A set of seed hits, represented by the lookups that came out of the big hash table. It can be over 32 or
// 64 bit indices, but its external interface is always 64 bits (it extends on the way out if necessary).
//
class HashTableHitSet {
public:
HashTableHitSet() {}
void firstInit(unsigned maxSeeds_, unsigned maxMergeDistance_, BigAllocator *allocator, bool doesGenomeIndexHave64BitLocations_);
//
// Reset to empty state.
//
void init();
//
// Record a hash table lookup. All recording must be done before any
// calls to getNextHitLessThanOrEqualTo. A disjoint hit set is a set of hits
// that don't share any bases in the read. This is interesting because the edit
// distance of a read must be at least the number of seeds that didn't hit for
// any disjoint hit set (because there must be a difference in the read within a
// seed for it not to hit, and since the reads are disjoint there can't be a case
// where the same difference caused two seeds to miss).
//
void recordLookup(unsigned seedOffset, _int64 nHits, const unsigned *hits, bool beginsDisjointHitSet);
void recordLookup(unsigned seedOffset, _int64 nHits, const GenomeLocation *hits, bool beginsDisjointHitSet);
//
// This efficiently works through the set looking for the next hit at or below this address.
// A HashTableHitSet only allows a single iteration through its address space per call to
// init().
//
bool getNextHitLessThanOrEqualTo(GenomeLocation maxGenomeLocationToFind, GenomeLocation *actualGenomeLocationFound, unsigned *seedOffsetFound);
//
// Walk down just one step, don't binary search.
//
bool getNextLowerHit(GenomeLocation *genomeLocation, unsigned *seedOffsetFound);
//
// Find the highest genome address.
//
bool getFirstHit(GenomeLocation *genomeLocation, unsigned *seedOffsetFound);
unsigned computeBestPossibleScoreForCurrentHit();
//
// This is bit of storage that the 64 bit lookup needs in order to extend singleton hits into 64 bits, since they may be
// stored in the index in fewer.
//
GenomeLocation *getNextSingletonLocation()
{
return &lookups64[nLookupsUsed].singletonGenomeLocation[1];
}
#if INSTRUMENTATION_FOR_PAPER
int getNumDistinctHitLocations(unsigned maxK);
#endif // INSTRUMENTATION_FOR_PAPER
private:
struct DisjointHitSet {
unsigned countOfExhaustedHits;
unsigned missCount;
};
int currentDisjointHitSet;
DisjointHitSet * disjointHitSets;
HashTableLookup<unsigned> * lookups32;
HashTableLookup<GenomeLocation> * lookups64;
HashTableLookup<unsigned> lookupListHead32[1];
HashTableLookup<GenomeLocation> lookupListHead64[1];
unsigned maxSeeds;
unsigned nLookupsUsed;
GenomeLocation mostRecentLocationReturned;
unsigned maxMergeDistance;
bool doesGenomeIndexHave64BitLocations;
}; // HashTableHitSet
HashTableHitSet * hashTableHitSets[NUM_READS_PER_PAIR][NUM_DIRECTIONS];
int countOfHashTableLookups[NUM_READS_PER_PAIR];
_int64 totalHashTableHits[NUM_READS_PER_PAIR][NUM_DIRECTIONS];
_int64 largestHashTableHit[NUM_READS_PER_PAIR][NUM_DIRECTIONS];
unsigned readWithMoreHits;
unsigned readWithFewerHits;
//
// A location that's been scored (or waiting to be scored). This is needed in order to do merging
// of close-together hits and to track potential mate pairs.
//
struct HitLocation {
GenomeLocation genomeLocation;
int genomeLocationOffset; // This is needed because we might get an offset back from scoring (because it's really scoring a range).
unsigned seedOffset;
bool isScored; // Mate pairs are sometimes not scored when they're inserted, because they
unsigned score;
unsigned maxK; // The maxK that this was scored with (we may need to rescore if we need a higher maxK and score is -1)
double matchProbability;
unsigned bestPossibleScore;
//
// We have to be careful in the case where lots of offsets in a row match well against the read (think
// about repetitive short sequences, i.e., ATTATTATTATT...). We want to merge the close ones together,
// but if the repetitive sequence extends longer than maxMerge, we don't want to just slide the window
// over the whole range and declare it all to be one. There is really no good definition for the right
// thing to do here, so instead all we do is that when we declare two candidates to be matched we
// pick one of them to be the match primary and then coalesce all matches that are within maxMatchDistance
// of the match primary. No one can match with any of the locations in the set that's beyond maxMatchDistance
// from the set primary. This means that in the case of repetitve sequences that we'll declare locations
// right next to one another not to be matches. There's really no way around this while avoiding
// matching things that are possibly much more than maxMatchDistance apart.
//
GenomeLocation genomeLocationOfNearestMatchedCandidate;
}; // HitLocation
char *rcReadData[NUM_READS_PER_PAIR]; // the reverse complement of the data for each read
char *rcReadQuality[NUM_READS_PER_PAIR]; // the reversed quality strings for each read
unsigned readLen[NUM_READS_PER_PAIR];
Read *reads[NUM_READS_PER_PAIR][NUM_DIRECTIONS]; // These are the reads that are provided in the align call, together with their reverse complements, which are computed.
Read rcReads[NUM_READS_PER_PAIR][NUM_DIRECTIONS];
char *reversedRead[NUM_READS_PER_PAIR][NUM_DIRECTIONS]; // The reversed data for each read for forward and RC. This is used in the backwards LV
LandauVishkin<> *landauVishkin;
LandauVishkin<-1> *reverseLandauVishkin;
// AffineGap<> *affineGap;
// AffineGap<-1> *reverseAffineGap;
AffineGapVectorized<> *affineGap;
AffineGapVectorized<-1> *reverseAffineGap;
char rcTranslationTable[256];
unsigned nTable[256];
BYTE *seedUsed;
inline bool IsSeedUsed(_int64 indexInRead) const {
return (seedUsed[indexInRead / 8] & (1 << (indexInRead % 8))) != 0;
}
inline void SetSeedUsed(_int64 indexInRead) {
seedUsed[indexInRead / 8] |= (1 << (indexInRead % 8));
}
//
// "Local probability" means the probability that each end is correct given that the pair itself is correct.
// Consider the example where there's exactly one decent match for one read, but the other one has several
// that are all within the correct range for the first one. Then the local probability for the second read
// is lower than the first. The overall probability of an alignment then is
// pairProbability * localProbability/ allPairProbability.
//
double localBestPairProbability[NUM_READS_PER_PAIR];
void scoreLocation(
unsigned whichRead,
Direction direction,
GenomeLocation genomeLocation,
unsigned seedOffset,
int scoreLimit,
int *score,
double *matchProbability,
int *genomeLocationOffset, // The computed offset for genomeLocation (which is needed because we scan several different possible starting locations)
bool *usedAffineGapScoring = NULL,
int *basesClippedBefore = NULL,
int *basesClippedAfter = NULL,
int *agScore = NULL,
int *totalIndelsLV = NULL,
bool *usedGaplessClipping = NULL,
int *genomeSpan = NULL
);
void scoreLocationWithAffineGap(
unsigned whichRead,
Direction direction,
GenomeLocation genomeLocation,
unsigned seedOffset,
int scoreLimit,
int *score,
double *matchProbability,
int *genomeLocationOffset,
int *basesClippedBefore,
int *basesClippedAfter,
int *agScore,
int *genomeSpan,
bool useAltLiftover = false
);
void scoreLocationWithAffineGapLiftover(
unsigned whichRead,
Direction direction,
GenomeLocation genomeLocation,
unsigned seedOffset,
int scoreLimit,
int *score,
double *matchProbability,
int *genomeLocationOffset,
int *basesClippedBefore,
int *basesClippedAfter,
int *agScore,
int *genomeSpan,
bool useAltLiftover = false
);
void scoreLocationWithHammingDistance(
unsigned whichRead,
Direction direction,
GenomeLocation genomeLocation,
unsigned seedOffset,
int scoreLimit,
int* score,
double* matchProbability,
int* genomeLocationOffset, // The computed offset for genomeLocation (which is needed because we scan several different possible starting locations)
bool* usedAffineGapScoring = NULL,
int* basesClippedBefore = NULL,
int* basesClippedAfter = NULL,
int* agScore = NULL,
bool* usedGaplessClipping = NULL,
int* scoreGapless = NULL
);
//
// These are used to keep track of places where we should merge together candidate locations for MAPQ purposes, because they're sufficiently
// close in the genome.
//
struct MergeAnchor {
double matchProbability;
GenomeLocation locationForReadWithMoreHits;
GenomeLocation locationForReadWithFewerHits;
int pairScore;
int pairAGScore;
void init(GenomeLocation locationForReadWithMoreHits_, GenomeLocation locationForReadWithFewerHits_, double matchProbability_, int pairScore_, int pairAGScore_) {
locationForReadWithMoreHits = locationForReadWithMoreHits_;
locationForReadWithFewerHits = locationForReadWithFewerHits_;
matchProbability = matchProbability_;
pairScore = pairScore_;
pairAGScore = pairAGScore_;
}
//
// Returns whether this candidate is a match for this merge anchor.
//
bool doesRangeMatch(GenomeLocation newMoreHitLocation, GenomeLocation newFewerHitLocation) {
GenomeDistance deltaMore = DistanceBetweenGenomeLocations(locationForReadWithMoreHits, newMoreHitLocation);
GenomeDistance deltaFewer = DistanceBetweenGenomeLocations(locationForReadWithFewerHits, newFewerHitLocation);
return deltaMore < 50 && deltaFewer < 50;
}
//
// Returns true and sets oldMatchProbability if this should be eliminated due to a match.
//
bool checkMerge(GenomeLocation newMoreHitLocation, GenomeLocation newFewerHitLocation, double newMatchProbability, int newPairScore,
int newAPairGScore, double *oldMatchProbability, bool *mergeReplacement = NULL);
}; // MergeAnchor
//
// We keep track of pairs of locations to score using two structs, one for each end. The ends for the read with fewer hits points into
// a list of structs for the end with more hits, so that we don't need one stuct for each pair, just one for each end, and also so that
// we don't need to score the mates more than once if they could be paired with more than one location from the end with fewer hits.
//
struct ScoringMateCandidate {
//
// These are kept in arrays in decreasing genome order, one for each set pair, so you can find the next largest location by just looking one
// index lower, and vice versa.
//
double matchProbability;
GenomeLocation readWithMoreHitsGenomeLocation;
int bestPossibleScore;
int score;
int scoreLimit; // The scoreLimit with which score was computed
unsigned seedOffset;
int genomeOffset;
bool usedAffineGapScoring;
//
// We keep track of possible big indels by looking at the seeding to see cases where seeds align differently to the beginning and end of the read
// When we think there might be an indel that's bigger than the current max edit distance for a possible alignment, we increase it so we find
// the indel (if it's really there; seeds aligning with an offset doesn't necessarily mean a real indel).
//
GenomeDistance largestBigIndelDetected;
bool usedGaplessClipping;
int basesClippedBefore;
int basesClippedAfter;
int agScore;
int lvIndels;
int refSpan;
void init(GenomeLocation readWithMoreHitsGenomeLocation_, unsigned bestPossibleScore_, unsigned seedOffset_) {
readWithMoreHitsGenomeLocation = readWithMoreHitsGenomeLocation_;
bestPossibleScore = bestPossibleScore_;
seedOffset = seedOffset_;
score = LocationNotYetScored;
scoreLimit = -1;
matchProbability = 0;
genomeOffset = 0;
usedAffineGapScoring = false;
usedGaplessClipping = false;
basesClippedBefore = 0;
basesClippedAfter = 0;
agScore = 0;
lvIndels = 0;
largestBigIndelDetected = 0;
refSpan = 0;
}
static const int LocationNotYetScored = -2;
}; // ScoringMateCandidate
struct ScoringCandidate {
ScoringCandidate * scoreListNext; // This is a singly-linked list
MergeAnchor * mergeAnchor;
unsigned scoringMateCandidateIndex; // Index into the array of scoring mate candidates where we should look
GenomeLocation readWithFewerHitsGenomeLocation;
unsigned whichSetPair;
unsigned seedOffset;
unsigned bestPossibleScore;
bool usedAffineGapScoring;
int largestBigIndelDetected;
bool usedGaplessClipping;
int basesClippedBefore;
int basesClippedAfter;
int agScore;
int lvIndels;
double matchProbability;
int refSpan;
void init(GenomeLocation readWithFewerHitsGenomeLocation_, unsigned whichSetPair_, unsigned scoringMateCandidateIndex_, unsigned seedOffset_,
unsigned bestPossibleScore_, ScoringCandidate *scoreListNext_)
{
readWithFewerHitsGenomeLocation = readWithFewerHitsGenomeLocation_;
whichSetPair = whichSetPair_;
_ASSERT(whichSetPair < NUM_SET_PAIRS); // You wouldn't think this would be necessary, but...
scoringMateCandidateIndex = scoringMateCandidateIndex_;
seedOffset = seedOffset_;
bestPossibleScore = bestPossibleScore_;
scoreListNext = scoreListNext_;
mergeAnchor = NULL;
usedAffineGapScoring = false;
usedGaplessClipping = false;
basesClippedBefore = 0;
basesClippedAfter = 0;
agScore = 0;
lvIndels = 0;
matchProbability = 1.0;
largestBigIndelDetected = 0;
refSpan = 0;
}
}; // ScoringCandidate
//
// A pool of scoring candidates. For each alignment call, we free them all by resetting lowestFreeScoringCandidatePoolEntry to 0,
// and then fill in the content when they're initialized. This means that for alignments with few candidates we'll be using the same
// entries over and over, so they're likely to be in the cache. We have maxK * maxSeeds * 2 of these in the pool, so we can't possibly run
// out. We rely on their being allocated in descending genome order within a set pair.
//
ScoringCandidate *scoringCandidatePool;
unsigned scoringCandidatePoolSize;
unsigned lowestFreeScoringCandidatePoolEntry;
//
// maxK + 1 lists of Scoring Candidates. The lists correspond to bestPossibleScore for the candidate and its best mate.
//
ScoringCandidate **scoringCandidates;
//
// The scoring mates. The each set scoringCandidatePoolSize / 2.
//
ScoringMateCandidate * scoringMateCandidates[NUM_SET_PAIRS];
unsigned lowestFreeScoringMateCandidate[NUM_SET_PAIRS];
//
// Merge anchors. Again, we allocate an upper bound number of them, which is the same as the number of scoring candidates.
//
MergeAnchor *mergeAnchorPool;
unsigned firstFreeMergeAnchor;
unsigned mergeAnchorPoolSize;
struct HitsPerContigCounts {
_int64 epoch; // Rather than zeroing this whole array every time, we just bump the epoch number; results with an old epoch are considered zero
int hits;
}; // HitsPerContigCounts
HitsPerContigCounts *hitsPerContigCounts; // How many alignments are we reporting for each contig. Used to implement -mpc, otheriwse unallocated.
int maxSecondaryAlignmentsPerContig;
_int64 contigCountEpoch;
struct ScoreSet {
ScoreSet() {
init();
}
void init() {
for (int i = 0; i < NUM_READS_PER_PAIR; i++) {
bestResultGenomeLocation[i] = InvalidGenomeLocation;
bestResultOrigGenomeLocation[i] = InvalidGenomeLocation;
bestResultScore[i] = ScoreAboveLimit;
bestResultDirection[i] = FORWARD;
bestResultUsedAffineGapScoring[i] = false;
bestResultBasesClippedBefore[i] = 0;
bestResultBasesClippedAfter[i] = 0;
bestResultAGScore[i] = 0;
bestResultSeedOffset[i] = 0;
bestResultLVIndels[i] = 0;
bestResultMatchProbability[i] = 0.0;
bestResultUsedGaplessClipping[i] = false;
bestResultRefSpan[i] = 0;
}
probabilityOfBestPair = 0;
probabilityOfAllPairs = 0;
bestPairScore = TooBigScoreValue;
bestPairAGScore = 0;
} // init()
void init(PairedAlignmentResult* result) {
for (int i = 0; i < NUM_READS_PER_PAIR; i++) {
bestResultGenomeLocation[i] = result->location[i];
bestResultOrigGenomeLocation[i] = result->origLocation[i];
bestResultScore[i] = result->score[i];
bestResultDirection[i] = result->direction[i];
bestResultUsedAffineGapScoring[i] = result->usedAffineGapScoring[i];
bestResultBasesClippedBefore[i] = result->basesClippedBefore[i];
bestResultBasesClippedAfter[i] = result->basesClippedAfter[i];
bestResultAGScore[i] = result->agScore[i];
bestResultSeedOffset[i] = result->seedOffset[i];
bestResultLVIndels[i] = result->lvIndels[i];
bestResultMatchProbability[i] = result->matchProbability[i];
bestResultUsedGaplessClipping[i] = result->usedGaplessClipping[i];
bestResultRefSpan[i] = result->refSpan[i];
}
probabilityOfBestPair = result->matchProbability[0] * result->matchProbability[1];
probabilityOfAllPairs = result->probabilityAllPairs;
bestPairScore = result->score[0] + result->score[1];
bestPairAGScore = result->agScore[0] + result->agScore[1];
}
void updateProbabilityOfAllPairs(double oldPairProbability);
inline void updateProbabilityOfBestPair(double newPairProbability, bool updateAllPairProbability = true) {
probabilityOfBestPair = newPairProbability;
if (updateAllPairProbability) {
probabilityOfAllPairs += probabilityOfBestPair;
}
}
bool updateBestHitIfNeeded(int pairScore, int pairAGScore, double pairProbability, int fewerEndScore, int readWithMoreHits, GenomeDistance fewerEndGenomeLocationOffset, ScoringCandidate* candidate, ScoringMateCandidate* mate); // returns true iff it updated the best hit
bool updateBestHitIfNeeded(int pairScore, int pairAGScore, double pairProbability, PairedAlignmentResult* newResult); // returns true iff it updated the best hit
void fillInResult(PairedAlignmentResult* result, unsigned *popularSeedsSkipped);
GenomeLocation bestResultGenomeLocation[NUM_READS_PER_PAIR];
GenomeLocation bestResultOrigGenomeLocation[NUM_READS_PER_PAIR];
Direction bestResultDirection[NUM_READS_PER_PAIR];
unsigned bestResultScore[NUM_READS_PER_PAIR];
bool bestResultUsedAffineGapScoring[NUM_READS_PER_PAIR];
int bestResultBasesClippedBefore[NUM_READS_PER_PAIR];
int bestResultBasesClippedAfter[NUM_READS_PER_PAIR];
int bestResultAGScore[NUM_READS_PER_PAIR];
int bestResultSeedOffset[NUM_READS_PER_PAIR];
int bestResultLVIndels[NUM_READS_PER_PAIR];
double bestResultMatchProbability[NUM_READS_PER_PAIR];
bool bestResultUsedGaplessClipping[NUM_READS_PER_PAIR];
int bestResultRefSpan[NUM_READS_PER_PAIR];
double probabilityOfBestPair;
double probabilityOfAllPairs;
int bestPairScore;
int bestPairAGScore;
Direction setPairDirection[NUM_SET_PAIRS][NUM_READS_PER_PAIR] = { {FORWARD, RC}, {RC, FORWARD} };
}; // ScoreSet
inline int computeScoreLimit(bool nonALTAlignment, const ScoreSet* scoresForAllAlignments, const ScoreSet* scoresForNonAltAlignments, GenomeDistance maxBigIndelSeen);
}; // IntersectingPairedEndAligner