forked from thegenemyers/DASCRUBBER
-
Notifications
You must be signed in to change notification settings - Fork 0
/
DAStrim.c
2707 lines (2278 loc) · 80.6 KB
/
DAStrim.c
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
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*******************************************************************************************
*
* Using overlap pile for each read and intrinisic quality values, determine the
* high quality segments with interspersed gaps. Any unremoved
* adaptemer sequences are dectected and the shorter side trimmed.
* Every gap is analyzed and either patched or splits the read.
*
* Author: Gene Myers
* Date : June 2016
*
*******************************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include "DB.h"
#include "align.h"
#ifdef HIDE_FILES
#define PATHSEP "/."
#else
#define PATHSEP "/"
#endif
#undef DEBUG_HQ_BLOCKS // Various DEBUG flags (normally all off)
#undef SHOW_EVENTS
#undef DEBUG_HOLE_FINDER
#undef DEBUG_GAP_STATUS
#undef SHOW_PAIRS
#undef DEBUG_PATCHING
#undef DEBUG_SUMMARY
#undef DEBUG_CLASS
#define ANNOTATE // Output annotation tracks for DaViewer
// Command format and global parameter variables
static char *Usage = " [-v] [-g<int>] [-b<int>] <source:db> <overlaps:las> ...";
static int COVERAGE; // estimated coverage
static int BAD_QV; // qv >= and you are "bad"
static int GOOD_QV; // qv <= and you are "good"
static int HGAP_MIN; // less than this length do not process for HGAP
static int VERBOSE;
// Gap states
#define LOWQ 0 // Gap is spanned by many LAs and patchable
#define SPAN 1 // Gap has many paired LAs and patchable
#define SPLIT 2 // Gap is a chimer or an unpatchable gap
#define ADAPT 3 // Gap is due to adaptemer (internal only)
// Good patch constants
#define MIN_BLOCK 500 // Minimum length of a good patch
// Gap constants
#define MIN_COVER 3 // A coverage gap occurs at or below this level
#define COVER_LEN 400 // An overlap covers a point if it extends COVER_LEN to either side.
#define ANCHOR_MATCH .25 // Delta in trace interval at both ends of patch must be < this %.
#define MIN_OVERLAP 900 // Was COVER_LEN, too small?
// Wall Constants
#define MIN_PNT 5 // Minimum # of events in a wall
#define MAX_SEP 25 // Maximum separation between two events in a wall
#define AVE_SEP 5. // Maximum average separation between two events in a wall
// Global Variables (must exist across the processing of each pile)
// Input
static int TRACE_SPACING; // Trace spacing (from .las file)
static DAZZ_DB _DB, *DB = &_DB; // Data base
static int DB_FIRST; // First read of DB to process
static int DB_LAST; // Last read of DB to process (+1)
static int DB_PART; // 0 if all, otherwise block #
static int64 *QV_IDX; // qual track index
static uint8 *QV; // qual track values
// Output
static FILE *TR_AFILE; // .trim.anno
static FILE *TR_DFILE; // .trim.data
static int64 TR_INDEX; // Current index into .trim.data file as it is being written
#ifdef ANNOTATE
static FILE *HQ_AFILE; // .hq.anno
static FILE *HQ_DFILE; // .hq.data
static int64 HQ_INDEX; // Current index into .hq.data file as it is being written
static FILE *HL_AFILE; // .hole.anno
static FILE *HL_DFILE; // .hole.data
static int64 HL_INDEX; // Current index into .hole.data file as it is being written
static FILE *SN_AFILE; // .span.anno
static FILE *SN_DFILE; // .span.data
static int64 SN_INDEX; // Current index into .span.data file as it is being written
static FILE *SP_AFILE; // .split.anno
static FILE *SP_DFILE; // .split.data
static int64 SP_INDEX; // Current index into .split.data file as it is being written
static FILE *AD_AFILE; // .adapt.anno
static FILE *AD_DFILE; // .adapt.data
static int64 AD_INDEX; // Current index into .adapt.data file as it is being written
static FILE *KP_AFILE; // .keep.anno
static FILE *KP_DFILE; // .keep.data
static int64 KP_INDEX; // Current index into .keep.data file as it is being written
#endif
// Statistics
static int64 nreads, totlen;
static int64 nelim, nelimbp;
static int64 n5trm, n5trmbp;
static int64 n3trm, n3trmbp;
static int64 natrm, natrmbp;
static int64 ngaps, ngapsbp;
static int64 nlowq, nlowqbp;
static int64 nspan, nspanbp;
static int64 nchim, nchimbp;
// Data Structures
typedef struct // General read interval [beg..end]
{ int beg;
int end;
} Interval;
// Coverage events, type (one of 7 below) and position
#define ADD 0 // leftmost A-position of LA
#define LFT 1 // ADD position + COVER_LEN of LA (>= 2*COVER_LEN long)
#define LGP 2 // left end of an HQ-block
#define CTR 3 // A-center of LA < 2*COVER_LEN long
#define RGP 4 // right end of an HQ-block
#define RGT 5 // DEL position - COVER_LEN of LA
#define DEL 6 // rightmost A-position of LA
#ifdef SHOW_EVENTS
static char Symbol[7] = { 'A', 'L', '[', 'C', ']', 'R', 'D' };
#endif
typedef struct
{ int type;
int pos;
} Event;
// Wall: there are cnt LFT/RGT events ending in the interval [beg,end] going
// from coverage depth cov up to cov+cnt
typedef struct
{ int beg;
int end;
int cnt;
int cov;
} Wall;
/*******************************************************************************************
*
* FIND ALL HIGH_QV BLOCKS OF EACH READ
*
********************************************************************************************/
// Find "good" blocks of trace point intervals:
// 0. A good block must begin and end with an interval <= GOOD_QV
// 1. Any stretch all < BAD_QV at least MIN_BLOCK long
// 2. Any stretch all <= GOOD_QV at least MIN_BLOCK-TRACE_SPACING long
// 3. Any stretch all <= GOOD_QV only 1 interval away from another good patch
// Global Inputs: QV, QV_IDX, GOOD_QV, BAD_QV
// HQ_BLOCKS[0..*nblk-1] contain the good patches in increase sequencing across aread.
// Parameter aread is input-only, and p_nblk is output-only.
static Interval *HQ_BLOCKS(int aread, int *p_nblk)
{ int nblk;
static int *alive = NULL;
static Interval *block = NULL;
int alen, atick;
uint8 *qvec;
alen = DB->reads[aread].rlen;
atick = (alen + (TRACE_SPACING-1))/TRACE_SPACING;
if (alive == NULL)
{ int max = DB->maxlen/TRACE_SPACING+2;
alive = (int *) Malloc(max*sizeof(int),"Allocating alive vector");
block = (Interval *) Malloc(max*sizeof(Interval),"Allocating block vector");
if (alive == NULL || block == NULL)
exit (1);
}
qvec = QV + QV_IDX[aread];
nblk = 0;
// Find all blocks < BAD_QV with either len >= MIN_BLOCK or all <= GOOD_QV in block[0..nblk)
// Mark those satisfying 1. or 2. as "alive" (.alv)
{ int lmost = 0, rmost = 0, thr;
int i, in;
thr = (MIN_BLOCK-1)/TRACE_SPACING;
in = 0;
for (i = 0; i <= atick; i++)
{ int q, alv;
if (i < atick)
q = qvec[i];
else
q = BAD_QV;
if (in)
{ if (q >= BAD_QV)
{ alv = (lmost-rmost >= thr);
if (alv)
{ block[nblk].beg = rmost;
block[nblk].end = lmost + 1;
alive[nblk] = alv;
nblk += 1;
}
else
{ int j, k;
for (j = rmost; j <= lmost; j = k)
{ for (k = j+1; k <= lmost; k++)
if (qvec[k] > GOOD_QV)
break;
block[nblk].beg = j;
block[nblk].end = k;
alive[nblk] = (k-j >= thr);
nblk += 1;
for ( ; k <= lmost; k++)
if (qvec[k] <= GOOD_QV)
break;
}
}
in = 0;
}
else if (q <= GOOD_QV)
lmost = i;
}
else
{ if (q <= GOOD_QV)
{ rmost = lmost = i;
in = 1;
}
}
}
}
// Mark as alive all short, all-good blocks that satisfy 3.
{ int i, j;
for (i = 0; i < nblk; i++)
if (alive[i])
{ for (j = i-1; j >= 0 && ! alive[j]; j--)
if (block[j+1].beg - block[j].end == 1)
alive[j] = 1;
else
break;
for (j = i+1; j < nblk && ! alive[j]; j++)
if (block[j].beg - block[j-1].end == 1)
alive[j] = 1;
else
break;
}
}
// Remove all blocks that are not alive
{ int i, j;
j = 0;
for (i = 0; i < nblk; i++)
if (alive[i])
{ block[j].beg = block[i].beg * TRACE_SPACING;
block[j].end = block[i].end * TRACE_SPACING;
j += 1;
}
nblk = j;
if (nblk > 0 && block[nblk-1].end > alen)
block[nblk-1].end = alen;
}
#ifdef DEBUG_HQ_BLOCKS
{ int i;
printf(" %3d:",nblk);
for (i = 0; i < nblk; i++)
printf(" [%5d,%5d]",block[i].beg,block[i].end);
printf("\n");
}
#endif
*p_nblk = nblk;
return (block);
}
/*******************************************************************************************
*
* WALL ANALYZER TO HELP AVOID REPEAT BOUNDARIES
*
********************************************************************************************/
// Find intervals of LFT/RGT events where no two events are separated by more than
// MAX_SEP, the average arrival rate is AVE_SEP, and there are at least MIN_PNT
// events in the interval.
static Wall *wall_detector(int *ev, int b, int e, Wall *next)
{ int idx;
{ int i, n, max;
double ave;
n = e-b;
if (n < MIN_PNT) return (next); // Too small: done
idx = b;
max = -1; // Find the position of the largest separation between
for (i = b+1; i < e; i++) // two tips in ev[b..e)
if (ev[i] - ev[i-1] > max)
{ max = ev[i] - ev[i-1];
idx = i;
}
ave = (ev[e-1] - ev[b]) / (n-1.); // Check if the current interval is a wall
if (ave <= AVE_SEP && max <= MAX_SEP)
{ if (max <= 4.*(ave+1.)) // Max separation < 4*average separation ?
{ next->beg = b;
next->end = e;
next->cnt = n;
return (next+1);
}
}
}
next = wall_detector(ev,b,idx,next); // If not then split on the largest separation
next = wall_detector(ev,idx,e,next); // and recurse on the two parts
return (next);
}
// Find LFT/RGT event walls
static Wall *find_walls(int novl, Event *queue, int *anum, int *dnum)
{ static int nmax = 0;
Wall *aptr, *dptr;
static Wall *wall = NULL;
int ntip;
static int *adds = NULL;
static int *dels;
if (novl == 0)
return (NULL);
if (novl > nmax)
{ nmax = novl*1.2 + 1000;
wall = (Wall *) Realloc(wall,sizeof(Wall)*2*(nmax/MIN_PNT),"Reallocating wall vector");
adds = (int *) Realloc(adds,sizeof(int)*2*nmax,"Reallocating add+del vectors");
if (wall == NULL || adds == NULL)
exit (1);
dels = adds + nmax;
}
// Make separate arrays of add and del tips (LFT and RGT events) in sorted order in
// which to seek "walls".
{ int i, j, x;
i = x = 0; // A bit tricky: less than novl tips due to CTR events
for (j = 0; x < novl; j++) // that don't generate tips, so analyze events until
if (queue[j].type == CTR) // have counted all LA's. Furthermore adds and dels
x += 1; // are sorted because queue is sorted.
else if (queue[j].type == LFT)
{ x += 1;
adds[i++] = queue[j].pos;
}
ntip = i;
i = 0;
for (j = 0; i < ntip; j++)
if (queue[j].type == RGT)
dels[i++] = queue[j].pos;
}
// Find LFT walls and RGT walls in [walls,aptr) and [aptr,dptr)
aptr = wall_detector(adds,0,ntip,wall);
dptr = wall_detector(dels,0,ntip,aptr);
// For each wall, determine the coverage of its base with a merged traversal
// of the adds and dels arrays
{ Wall *a, *d;
int i, j, x;
x = 0;
a = wall;
d = aptr;;
i = j = 0;
while (j < ntip)
if (i < ntip && adds[i] < dels[j])
{ if (a->beg == i)
a->cov = x;
else if (a->end == i+1)
{ a += 1;
if (a >= aptr)
a -= 1;
}
x += 1;
i += 1;
}
else
{ if (d->beg == j)
d->cov = x - d->cnt;
else if (d->end == j+1)
{ d += 1;
if (d >= dptr)
d -= 1;
}
x -= 1;
j += 1;
}
}
// Sneaky, switch beg/end from an index into the adds or dels array, to the actually
// coordinate of the event.
{ Wall *a;
for (a = wall; a < aptr; a++)
{ a->beg = adds[a->beg];
a->end = adds[a->end-1];
}
for (a = aptr; a < dptr; a++)
{ a->beg = dels[a->beg];
a->end = dels[a->end-1];
}
}
*anum = aptr-wall;
*dnum = dptr-aptr;
return (wall);
}
/*******************************************************************************************
*
* COVERAGE ANALYSIS TO FIND ALL HOLES (regions of very low coverage/support)
*
********************************************************************************************/
// Find intervals for which there are MIN_COVER or fewer LAs that project at least COVER_LEN
// bases to the left and right of the interval. These are called holes.
// Holes are usually found between HQ-blocks. However occasionally they intersect one or
// more blocks and this requires the HQ-blocks be refined as follows:
// a. Hole spans an HQ-block:
// The block needs to be removed as HQ *if* it is not based on 5 or more LA's
// (this usually never happens, 10^-5 or less)
// b. Hole is contained in an HQ-block:
// The block needs to be split around the hole because one needs to verify that
// the left and right regions on each side of a hole actually belong together
// (this happens occasionaly, ~ 10^-3)
// c. Hole overlaps an HQ-block:
// If this happens, then the overlap is very small and the block is left unperturbed.
// (this worries me a bit, but in all testing it (very small overlap) remains so)
// Given the above possibilities, the list of HQ-blocks can be modified by FIND_HOLES.
static int ESORT(const void *l, const void *r)
{ Event *x = (Event *) l;
Event *y = (Event *) r;
if (x->pos == y->pos)
return (x->type - y->type);
return (x->pos - y->pos);
}
static int FIND_HOLES(int aread, Overlap *ovls, int novl, Interval *block, int nblk)
{ static int nmax = 0;
int nev;
static Event *queue = NULL; // Event queue[0..nev)
int nhole;
static Interval *holes = NULL; // Detected holes[0..nhole)
static int pmax;
static Interval *cover = NULL; // Coverage at block ends [0..nblk)
static Interval *nwblk; // Modified block list [0..nblk')
int anum = 0, dnum = 0; // LFT and RGT walls, awall[0..anum) & dwall[0..dnum)
Wall *awall, *dwall;
if (cover == NULL)
{ pmax = DB->maxlen/TRACE_SPACING + 2;
cover = (Interval *) Malloc(2*pmax*sizeof(Interval),"Allocating patch vector");
nwblk = cover + pmax;
}
if (4*novl + pmax > nmax)
{ nmax = 4.8*novl + pmax + 100;
queue = (Event *) Realloc(queue,(nmax+1)*sizeof(Event),"Allocating event queue");
holes = (Interval *) Realloc(holes,(nmax/4)*sizeof(Interval),"Allocating hole vector");
if (queue == NULL || holes == NULL)
exit (1);
}
{ int i;
// For each trimmed overlap: add its events to the queue
nev = 0;
for (i = 0; i < novl; i++)
{ queue[nev].type = ADD;
queue[nev].pos = ovls[i].path.abpos;
nev += 1;
queue[nev].type = DEL;
queue[nev].pos = ovls[i].path.aepos;
nev += 1;
if (ovls[i].path.abpos + 2*COVER_LEN + 10 > ovls[i].path.aepos)
{ queue[nev].type = CTR;
queue[nev].pos = (ovls[i].path.abpos + ovls[i].path.aepos) / 2;
nev += 1;
}
else
{ queue[nev].type = LFT;
queue[nev].pos = ovls[i].path.abpos + COVER_LEN;
nev += 1;
queue[nev].type = RGT;
queue[nev].pos = ovls[i].path.aepos - COVER_LEN;
nev += 1;
}
}
// For each HQ-block: add its events to the queue
for (i = 0; i < nblk; i++)
{ queue[nev].type = LGP;
queue[nev].pos = block[i].beg;
nev += 1;
queue[nev].type = RGP;
queue[nev].pos = block[i].end;
nev += 1;
}
queue[nev].pos = DB->reads[aread].rlen;
}
// Sort the events
qsort(queue,nev,sizeof(Event),ESORT);
// Find all LFT and RGT walls
awall = find_walls(novl,queue,&anum,&dnum);
dwall = awall + anum;
#ifdef DEBUG_HOLE_FINDER
{ int i;
printf("\n");
for (i = 0; i < anum; i++)
printf(" Add [%5d,%5d] %d %d\n",awall[i].beg,awall[i].end,awall[i].cnt,awall[i].cov);
for (i = 0; i < dnum; i++)
printf(" Del [%5d,%5d] %d %d\n",dwall[i].beg,dwall[i].end,dwall[i].cnt,dwall[i].cov);
printf("\n");
}
#endif
// Move through events in order keeping track of inc, dec, & cnf so that the
// invariant stated below holds
{ int cnf, inc, dec;
int cblk;
int in;
int nbeg, nend = 0;
int first, last;
int i;
in = 1;
first = -1;
cblk = 0;
nhole = 0;
inc = dec = cnf = 0;
for (i = 0; i < nev; i++)
{ switch (queue[i].type)
{ case ADD:
inc += 1;
break;
case LFT:
inc -= 1;
cnf += 1;
break;
case LGP:
cover[cblk].beg = cnf + inc + dec; // = coverage depth at block[cblk].beg
continue;
case CTR:
inc -= 1;
dec += 1;
continue;
case RGP:
cover[cblk].end = cnf + inc + dec; // = coverage depth at block[cblk].end
cblk += 1;
continue;
case RGT:
cnf -= 1;
dec += 1;
break;
case DEL:
dec -= 1;
break;
}
// For position x = queue[i].pos:
// inc = # of LA's between (ADD,LFT] positions
// dec = # of LA's between (RGT,DEL] positions
// cnf = # of LA's between (LFT,RGT] positions (= # of LAs tat project at least
// COVER_LEN bases to the right and left of x!
#ifdef SHOW_EVENTS
printf(" %5d %c: %3d< %3d >%3d %3d\n",
queue[i].pos,Symbol[queue[i].type],inc,cnf,dec,dec-inc);
#endif
// When truncated coverage, cnf, transitions below MIN_COVER(3), note the fact (in = 1)
// and record the index first of the event (must be a RGT) and the number of LA's
// currently in their (RGT,DEL] interval
if (cnf <= MIN_COVER)
{ if ( ! in)
{ in = 1;
nend = dec;
first = i;
}
}
// When truncated coverage transitions above MIN_COVER, we declare it a hole
// if interval below MIN_COVER is at least COVER_LEN long, there are at least
// 4 LA's that are "ending" at the left (i.e. in (RGT,DEL] interval, and
// at least 4 LA's ending at the right.
else
{ if (in && first >= 0 && queue[i].pos - queue[first].pos >= COVER_LEN &&
nend >= 4 && inc >= 4)
{ int lflank, rflank;
int dpos, apos;
nbeg = inc;
last = i;
// Need to find the boundaries of the hole. In principle, this is
// [dpos + COVER_LEN, apos - COVER_LEN] where apos = queue[first].pos
// and dpos = queue[last].pos, i.e. the entry and exit into the low
// truncated cover interval. However, walls induced by repeat boundaries
// and/or uneveness in the end-points of LA's can cause the above to be
// quite far off. So ...
// First try the average of the 2nd and 3rd quartile of the nend RGT events
// before dpos. The requisite number of events must exist by the definition
// of nend. While one is at it determine the index of the first of the
// nend RGT events in lflank.
{ int64 sum;
int q1, q3, n;
int a, d, k;
int acov, dcov;
q1 = nend/4;
q3 = (3*nend)/4;
sum = 0;
n = 0;
for (lflank = first; n < nend; lflank--)
if (queue[lflank].type == RGT || queue[lflank].type == CTR)
{ if (n >= q1 && n < q3)
sum += queue[lflank].pos;
n += 1;
}
dpos = sum/(q3-q1);
lflank += 1;
#ifdef DEBUG_HOLE_FINDER
printf(" Dev %5d-%3d-%5d -> %5d",queue[lflank].pos,nend,queue[first].pos,dpos);
#endif
// Second, look for the leftmost RGT-(LFT-)wall that overlaps the left (right)
// flank, i.e. queue[lflank,first].pos (queue[last,rflank].pos), and if found
// take the average position of the flank position within the wall.
for (d = dnum-1; d >= 0; d--)
if (dwall[d].beg <= queue[first].pos)
break;
if (d >= 0 && dwall[d].end >= queue[lflank].pos)
{ sum = 0;
n = 0;
for (k = first; k >= lflank; k--)
if (queue[k].type == RGT || queue[k].type == CTR)
{ if (queue[k].pos < dwall[d].beg)
break;
if (queue[k].pos <= dwall[d].end)
{ sum += queue[k].pos;
n += 1;
}
}
dpos = sum/n;
#ifdef DEBUG_HOLE_FINDER
printf(" Map [%5d,%5d] -> %4d\n",dwall[d].beg,dwall[d].end,dpos);
#endif
dcov = dwall[d].cov + dwall[d].cnt;
d -= 1;
}
else
{ dcov = nend + MIN_COVER;
#ifdef DEBUG_HOLE_FINDER
printf(" No wall mapping\n");
#endif
}
// First try on LFT events (replace nend with nbeg, RGT with LFT, before
// with after, and dpos with apos, first with last, and lflank with rflank.
q1 = nbeg/4;
q3 = (3*nbeg)/4;
sum = 0;
n = 0;
for (rflank = last; n < nbeg; rflank++)
if (queue[rflank].type == LFT || queue[rflank].type == CTR)
{ if (n >= q1 && n < q3)
sum += queue[rflank].pos;
n += 1;
}
apos = sum/(q3-q1);
rflank -= 1;
#ifdef DEBUG_HOLE_FINDER
printf(" Aev %5d-%3d-%5d -> %5d",queue[i].pos,nbeg,queue[rflank].pos,apos);
#endif
// Second look at LFT events.
for (a = 0; a < anum; a++)
if (awall[a].end >= queue[i].pos)
break;
if (a < anum && awall[a].beg <= queue[rflank].pos)
{ sum = 0;
n = 0;
for (k = i; k <= rflank; k++)
if (queue[k].type == LFT || queue[k].type == CTR)
{ if (queue[k].pos > awall[a].end)
break;
if (queue[k].pos >= awall[a].beg)
{ sum += queue[k].pos;
n += 1;
}
}
apos = sum/n;
#ifdef DEBUG_HOLE_FINDER
printf(" Map [%5d,%5d] -> %4d\n",awall[a].beg,awall[a].end,apos);
#endif
acov = awall[a].cov + awall[a].cnt;
a += 1;
}
else
{ acov = nbeg + MIN_COVER;
#ifdef DEBUG_HOLE_FINDER
printf(" No wall mapping\n");
#endif
}
// If apos and dpos are still so close that the implied hole boundaries
// are out of order by 50 or more bases, then walk back through ascending
// walls (if present) until this is no longer true or there are no more
// more walls left. If both left and right options exist, always take
// the wall starting at the lower current height.
while (apos - dpos < 2*COVER_LEN - 50)
{ if (d >= 0 && dwall[d].cov >= dcov)
if (a < anum && awall[a].cov >= acov)
{ if (dcov < acov)
{ dcov = dwall[d].cov + dwall[d].cnt;
dpos = dwall[d--].beg;
#ifdef DEBUG_HOLE_FINDER
printf(" Push <- %d\n",dpos);
#endif
}
else
{ acov = awall[a].cov + awall[a].cnt;
apos = awall[a++].end;
#ifdef DEBUG_HOLE_FINDER
printf(" Push -> %d\n",apos);
#endif
}
}
else
{ dcov = dwall[d].cov + dwall[d].cnt;
dpos = dwall[d--].beg;
#ifdef DEBUG_HOLE_FINDER
printf(" Push <- %d\n",dpos);
#endif
}
else
if (a < anum && awall[a].cov >= acov)
{ acov = awall[a].cov + awall[a].cnt;
apos = awall[a++].end;
#ifdef DEBUG_HOLE_FINDER
printf(" Push -> %d\n",apos);
#endif
}
else
{
#ifdef DEBUG_HOLE_FINDER
printf(" FAULT\n");
#endif
break;
}
}
}
// Finalize and record the hole boundaries.
holes[nhole].beg = dpos + COVER_LEN;
holes[nhole].end = apos - COVER_LEN;
nhole += 1;
}
in = 0;
}
}
}
// See if the holes remove or split any HQ-blocks and build the revised list
// in newblk[0..q).
{ int i, p, q, x;
int lhang, rhang;
#ifdef DEBUG_HOLE_FINDER
int reverse;
#endif
// For each hole in left-to-right order
p = q = 0;
for (i = 0; i < nhole; i++)
{ if (holes[i].beg > holes[i].end)
{ x = holes[i].beg;
holes[i].beg = holes[i].end;
holes[i].end = x;
#ifdef DEBUG_HOLE_FINDER
reverse = 1;
#endif
}
#ifdef DEBUG_HOLE_FINDER
else
reverse = 0;
#endif
// Advance to the next block p that intersects with or is to the right of hole
// moving blocks being skipped over to the new block list
while (p < nblk && block[p].end <= holes[i].beg)
nwblk[q++] = block[p++];
#ifdef DEBUG_HOLE_FINDER
printf(" HOLE: %5d [%5d,%5d]\n",
aread+1,holes[i].beg,holes[i].end);
#endif
// While the current block intersects the current hole
while (p < nblk && block[p].beg < holes[i].end)
{ lhang = (holes[i].beg < block[p].beg);
rhang = (holes[i].end > block[p].end);
if (lhang)
{ if (rhang)
// Hole i contains block p: remove it if coverage <= 4 at both ends
{ if (block[p].end - block[p].beg >= MIN_BLOCK &&
(cover[p].beg > 4 || cover[p].end > 4))
nwblk[q++] = block[p];
p += 1;
#ifdef DEBUG_HOLE_FINDER
printf(" INTERSECT %5d S [%5d,%5d] %3d %3d",
aread+1,block[p-1].beg,block[p-1].end,cover[p-1].beg,cover[p-1].end);
if (reverse)
printf(" REV");
printf("\n");
#endif
}
// Hole i intersect the left tip of block p: nothing to do
else
{
#ifdef DEBUG_HOLE_FINDER
printf(" INTERSECT %5d Z %5d [..,%5d] %3d",
aread+1,holes[i].end-block[p].beg,holes[i].end,cover[p].beg);
if (reverse)
printf(" REV");
printf("\n");
#endif
break;
}
}
else
if (rhang)
// Hole i intersect the right tip of block p: move p to new block list
{ nwblk[q++] = block[p++];
#ifdef DEBUG_HOLE_FINDER
printf(" INTERSECT %5d Z %5d [%5d,..] %3d",
aread+1,block[p-1].end-holes[i].beg,holes[i].beg,cover[p-1].end);
if (reverse)
printf(" REV");
printf("\n");
#endif
}
else
// Hole i is contained within block p: Break block into two parts at
// TRACE_SPACING ticks left and right of hole, and keep each piece
// if they are greater than MIN_BLOCK long.
{ int beg, end;
#ifdef DEBUG_HOLE_FINDER
printf(" INTERSECT %5d C %5d [%5d,%5d]",
aread+1,holes[i].end-holes[i].beg,block[p].beg,block[p].end);
if (reverse)
printf(" REV");
printf("\n");
#endif
beg = (holes[i].beg/TRACE_SPACING);
end = (holes[i].end-1)/TRACE_SPACING+1;
if (beg == end)
{ beg -= 1; end += 1; }
beg *= TRACE_SPACING;
end *= TRACE_SPACING;
if (beg - block[p].beg >= MIN_BLOCK)
{ nwblk[q].beg = block[p].beg;
nwblk[q++].end = beg;
}
if (block[p].end - end >= MIN_BLOCK)
block[p].beg = end;
else
p += 1;
break;
}
}
}
// Remove any remaining blocks to the new list
while (p < nblk)
nwblk[q++] = block[p++];
nblk = q;
// Transfer new blocks to original block vector
for (i = 0; i < nblk; i++)
block[i] = nwblk[i];
}
#ifdef ANNOTATE
{ int i;
for (i = 0; i < nhole; i++)
if (holes[i].end - holes[i].beg < 75)
{ holes[i].end += 50;
holes[i].beg -= 50;
fwrite(&(holes[i].beg),sizeof(int),1,HL_DFILE);
fwrite(&(holes[i].end),sizeof(int),1,HL_DFILE);
holes[i].end -= 50;
holes[i].beg += 50;
}
else