-
Notifications
You must be signed in to change notification settings - Fork 51
/
utils.c
1170 lines (1067 loc) · 30.3 KB
/
utils.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
#include <ctype.h>
#include <stdbool.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdint.h>
#include "stdaln.h"
#include "utils.h"
SQP SQP_init(){
//allocate an SQP
return (SQP) malloc(sizeof(Sqp));
}
/**
* Calculates the resulting phred 33 score given a mismatch
*/
char mismatch_p33_merge(char pA, char pB){
if(pA > pB){
return max( min(pA-(pB-33),maximum_quality), MIN_QUAL);
}else{
return max( min(pB-(pA-33),maximum_quality), MIN_QUAL);
}
}
bool isXDNA(char c){
//A R N D C Q E G H I L K M F P S T W Y V * X
switch(toupper(c)){
case 'A':
case 'C':
case 'G':
case 'T':
case 'N':
case 'X':
case 'R':
case 'W':
case '.':
return true;
default:
return false;
}
}
/**
* Calculates the resulting phred 33 score given a match
*/
char match_p33_merge(char pA, char pB){
pA = min(pA, maximum_quality);
pB = min(pB, maximum_quality);
char res = pA+(pB-33);
return max(min(res,maximum_quality), MIN_QUAL);
}
char gap_p33_qual(char q){
return max(min(((q-33)>>1)+33,maximum_quality), MIN_QUAL);
}
void pretty_print_alignment_stdaln(gzFile out, SQP sqp, AlnAln *aln, bool first_adapter, bool second_adapter, bool print_merged){
if(!(first_adapter || second_adapter)){
gzprintf(out,"Read Alignment Score:%d, Suboptimal Score:%d\nID:%s\n",aln->score, aln->subo ,sqp->fid);
gzprintf(out,"READ1: %s\n",aln->out1);
gzprintf(out," %s\n",aln->outm);
gzprintf(out,"READ2: %s\n",aln->out2);
if(print_merged)
gzprintf(out,"MERGD: %s\n\n",sqp->merged_seq);
else
gzprintf(out,"\n");
return;
}else if(first_adapter){
gzprintf(out,"Adapter Alignment Score:%d, Suboptimal Score:%d\nID:%s\n",aln->score, aln->subo ,sqp->fid);
}else if(second_adapter){
gzprintf(out,"Adapter Alignment Score:%d, Suboptimal Score:%d\nID:%s\n",aln->score, aln->subo ,sqp->rid);
}
gzprintf(out,"READ: %s\n",aln->out1);
gzprintf(out," %s\n",aln->outm);
gzprintf(out,"ADPT: %s\n\n",aln->out2);
}
/**
* Print the alignment in the pretty form:
* Subj: TGCTAGACTAGCATCG
* | |||*|||
* Quer: ACGTGCATCCTANACT
* Stars represent good quality mismatches,
* spaces represent ignored mismatches,
* vertical bars represent matches of any type
*
*/
void pretty_print_alignment(gzFile out, SQP sqp, char adj_q_cut, bool sort){
char *queryseq;
char *queryqual;
char *subjseq;
char *subjqual;
int querylen = 0;
int subjlen = 0;
int i;
if((!sort) || (sqp->flen >= sqp->rlen)){
subjseq = sqp->fseq;
subjqual = sqp->fqual;
queryseq = sqp->rc_rseq;
queryqual = sqp->rc_rqual;
querylen = sqp->rlen;
subjlen = sqp->flen;
}else{
subjseq = sqp->rc_rseq;
subjqual = sqp->rc_rqual;
queryseq = sqp->fseq;
queryqual = sqp->fqual;
querylen = sqp->flen;
subjlen = sqp->rlen;
}
gzprintf(out, "ID: %s\n",sqp->fid);
gzprintf(out, "SUBJ: %s\n",subjseq);
//now print out the bars
gzprintf(out, " "); //initial space
for(i=0;i<sqp->merged_len;i++){
if(i >= sqp->mpos && i < subjlen && i < (querylen + sqp->mpos)){
//we are in the overlapping region
if(subjseq[i] == queryseq[i-sqp->mpos])
gzputc(out,'|');
else if(subjqual[i] < adj_q_cut || queryqual[i-sqp->mpos] < adj_q_cut)
gzputc(out,' ');
else
gzputc(out,'*');
}else{
gzputc(out,' ');
}
}
gzprintf(out,"\nQUER: ");
for(i=0;i<sqp->mpos;i++)
gzputc(out,' '); //spaces before aln
gzprintf(out,"%s",queryseq);
gzprintf(out,"\nMERG: %s\n\n",sqp->merged_seq);
}
/**
* After performing overlap post adapter trimming,
* this trims the ends of the reads the same way as when
* they are merged, but otherwise leaves the nucleotides
* the same as they were.
*/
void make_blunt_ends(SQP sqp, AlnAln *aln){
int len = strlen(aln->out1);
char *out1, *out2;
out1 = aln->out1;
out2 = aln->out2;
int i,p1,p2; //p1,2 store pointers to corresponding pos in original seqs
p1 = p2 = 0;
char c1,c2,q1,q2,t1,t2;
bool trim_overhang = true;
bool end_gaps;
bool begin_gaps = trim_overhang;
int j1 = 0;
int j2 = 0;
int k;
for(i=0;i<len;i++){
c1 = toupper(out1[i]);
c2 = toupper(out2[i]);
q1 = sqp->fqual[p1];
q2 = sqp->rc_rqual[p2];
if(isXDNA(c1) && isXDNA(c2)){
sqp->fseq[j1] = c1;
sqp->fqual[j1] = q1;
sqp->rc_rseq[j2] = c2;
sqp->rc_rqual[j2] = q2;
//case 1 both are DNA, choose one with best score and subtract
if (begin_gaps) begin_gaps = false; //switch it off now that we have seen a match
//increment both positions of the reads
p1++;
p2++;
j1++;
j2++;
}else if(isXDNA(c1)){
// c2 is a gap
if (!begin_gaps){
sqp->fseq[j1] = c1;
sqp->fqual[j1] = q1;
//now check to see if we are done:
if(trim_overhang){
end_gaps = true;
for(k=i;k<len;k++){
t2 = out2[k];
if(t2 != '-'){
end_gaps = false;
break;
}
}
if(end_gaps){
//everything after this is a gap
break;
}
}
j1++;
}
//increment the first
p1++;
}else if(isXDNA(c2)){
//c1 is a gap
if(!begin_gaps){
sqp->rc_rseq[j2] = c2;
sqp->rc_rqual[j2] = q2;
if(trim_overhang){
end_gaps = true;
for(k=i;k<len;k++){
t1 = out1[k];
if(t1 != '-'){
end_gaps = false;
break;
}
}
if(end_gaps){
//everything after this is a gap
break;
}
}
j2++;
}
//increment the second
p2++;
}
}
sqp->fseq[j1] = '\0';
sqp->fqual[j1] = '\0';
sqp->flen = j1;
sqp->rc_rseq[j2] = '\0';
sqp->rc_rqual[j2] = '\0';
sqp->rlen = j2;
strncpy(sqp->rseq,sqp->rc_rseq,sqp->rlen+1);
strncpy(sqp->rqual,sqp->rc_rqual,sqp->rlen+1);
rev_qual( sqp->rqual, sqp->rlen );
revcom_seq( sqp->rseq, sqp->rlen);
}
void fill_merged_sequence(SQP sqp, AlnAln *aln, bool trim_overhang){
int len = strlen(aln->out1);
char *out1, *out2;
out1 = aln->out1;
out2 = aln->out2;
int i,p1,p2; //p1,2 store pointers to corresponding pos in original seqs
p1 = p2 = 0;
char c1,c2,q1,q2,t1,t2;
bool end_gaps;
bool begin_gaps = trim_overhang;
int j = 0;
int k;
for(i=0;i<len;i++){
c1 = toupper(out1[i]);
c2 = toupper(out2[i]);
q1 = sqp->fqual[p1];
q2 = sqp->rc_rqual[p2];
if(isXDNA(c1) && isXDNA(c2)){
//case 1 both are DNA, choose one with best score and subtract
if (begin_gaps) begin_gaps = false; //switch it off now that we have seen a match
if(c1 == c2){
sqp->merged_seq[j] = c1;
sqp->merged_qual[j] = match_p33_merge(q1,q2);
}else if(q2 > q1){
sqp->merged_seq[j] = c2;
sqp->merged_qual[j] = mismatch_p33_merge(q2,q1);
}else{
sqp->merged_seq[j] = c1;
sqp->merged_qual[j] = mismatch_p33_merge(q1,q2);
}
//increment both positions of the reads
p1++;
p2++;
j++;
}else if(isXDNA(c1)){
// c2 is a gap
if (!begin_gaps){
sqp->merged_seq[j] = c1;
sqp->merged_qual[j] = gap_p33_qual(q1); //divide score by 2
//now check to see if we are done:
if(trim_overhang){
end_gaps = true;
for(k=i;k<len;k++){
t2 = out2[k];
if(t2 != '-'){
end_gaps = false;
break;
}
}
if(end_gaps){
//everything after this is a gap
break;
}
}
j++;
}
//increment the first
p1++;
}else if(isXDNA(c2)){
//c1 is a gap
if(!begin_gaps){
sqp->merged_seq[j] = c2;
sqp->merged_qual[j] = gap_p33_qual(q2); //divide score by 2
if(trim_overhang){
end_gaps = true;
for(k=i;k<len;k++){
t1 = out1[k];
if(t1 != '-'){
end_gaps = false;
break;
}
}
if(end_gaps){
//everything after this is a gap
break;
}
}
j++;
}
//increment the second
p2++;
}
}
sqp->merged_seq[j] = '\0';
sqp->merged_qual[j] = '\0';
sqp->merged_len = j;
}
void SQP_destroy(SQP sqp){
//free up an SQP
free(sqp);
}
/**
* adapter_trim:
*
*
*/
bool adapter_trim(SQP sqp, size_t min_ol_adapter,
char *forward_primer, char *forward_primer_dummy_qual,
int forward_primer_len,
char *reverse_primer, char *reverse_primer_dummy_qual,
int reverse_primer_len,
unsigned short min_match_adapter[MAX_SEQ_LEN+1],
unsigned short max_mismatch_adapter[MAX_SEQ_LEN+1],
unsigned short min_match_reads[MAX_SEQ_LEN+1],
unsigned short max_mismatch_reads[MAX_SEQ_LEN+1],
char qcut,
bool use_mask){
//adapters on reads if the insert size is less than the read length, the adapter
// appears at the end of the sequence.
/**
* First check for adapter match before the first position of the read
*/
int pfpos = compute_ol(
forward_primer, forward_primer_dummy_qual, forward_primer_len,
sqp->fseq,sqp->fqual,sqp->flen,
max(min(forward_primer_len,sqp->flen)-5,0), min_match_adapter, max_mismatch_adapter,
false, qcut);
int prpos = compute_ol(
reverse_primer, reverse_primer_dummy_qual, reverse_primer_len,
sqp->rseq,sqp->rqual,sqp->rlen,
max(min(reverse_primer_len,sqp->rlen)-5,0), min_match_adapter, max_mismatch_adapter,
false, qcut);
if(pfpos >= 0 || prpos >= 0){
//yikes, a match to the adapter at the first position!
sqp->fseq[0] = '\0';
sqp->fqual[0] = '\0';
sqp->flen = 0;
sqp->rseq[0] = '\0';
sqp->rqual[0] = '\0';
sqp->rlen = 0;
sqp->rc_rqual[0] = '\0';
sqp->rc_rseq[0] = '\0';
return true;
}
/**
* now check for the adapter after the first position of the read
*/
int fpos = compute_ol(sqp->fseq,sqp->fqual,sqp->flen,
forward_primer, forward_primer_dummy_qual, forward_primer_len,
min_ol_adapter, min_match_adapter, max_mismatch_adapter,
false, qcut);
int rpos = compute_ol(sqp->rseq,sqp->rqual,sqp->rlen,
reverse_primer, reverse_primer_dummy_qual, reverse_primer_len,
min_ol_adapter, min_match_adapter, max_mismatch_adapter,
false, qcut);
if(fpos != CODE_NOMATCH || rpos != CODE_NOMATCH){
//check if reads are long enough to do anything with.
// trim adapters
int sz_sqp;
int iter;
if(fpos >=0){
if(use_mask){
sz_sqp = sizeof(sqp->fseq);
for(iter=sqp->flen; iter<sz_sqp && (sqp->fseq[iter] != '\0'); iter++){
sqp->fseq[iter]='N';
}
sqp->flen=iter;
}else{
sqp->fseq[fpos] = '\0';
sqp->fqual[fpos] = '\0';
sqp->flen = fpos;
}
}
if(rpos >= 0){
if(use_mask){
sz_sqp = sizeof(sqp->rseq);
for(iter=sqp->rlen; iter<sz_sqp && (sqp->rseq[iter] != '\0'); iter++){
sqp->rseq[iter]='N';
}
sqp->rlen=iter;
}else{
sqp->rseq[rpos] = '\0';
sqp->rqual[rpos] = '\0';
sqp->rlen = rpos;
}
}
// now re-reverse complement the sequences
strncpy(sqp->rc_rseq,sqp->rseq,sqp->rlen+1);
strncpy(sqp->rc_rqual,sqp->rqual,sqp->rlen+1);
rev_qual(sqp->rc_rqual, sqp->rlen);
revcom_seq(sqp->rc_rseq, sqp->rlen);
//adapters present
return true;
}
return read_olap_adapter_trim(sqp, min_ol_adapter,
min_match_adapter, max_mismatch_adapter,
min_match_reads, max_mismatch_reads,
qcut, use_mask);
}
/**
* look for adapters by read overlap
*
*/
bool read_olap_adapter_trim(SQP sqp, size_t min_ol_adapter,
unsigned short min_match_adapter[MAX_SEQ_LEN+1],
unsigned short max_mismatch_adapter[MAX_SEQ_LEN+1],
unsigned short min_match_reads[MAX_SEQ_LEN+1],
unsigned short max_mismatch_reads[MAX_SEQ_LEN+1],
char qcut, bool use_mask){
////////////
// Look at the adapter overhang
// Starting from our minimum adapter overlap
// check to see if there is total overlap with
//Round1:
// ---------- Subj
// ---------- Query
//Round2:
// ---------- Subj
// ---------- Query
//...
//we can get this effect by swapping the query and subj, and then have a high minimum
//overlap
char *queryseq= sqp->rc_rseq;
char *queryqual= sqp->rc_rqual;
char *subjseq= sqp->fseq;
char *subjqual= sqp->fqual;
int querylen = sqp->rlen;
int subjlen = sqp->flen;
int ppos = compute_ol(
queryseq, queryqual, querylen,
subjseq, subjqual, subjlen,
//min(subjlen,min(min_ol_adapter,querylen)),
max(0,min(querylen,subjlen)-min_ol_adapter-1),
min_match_reads, max_mismatch_reads,
true, qcut ); //pass true here so ambiguous matches are avoided
if(ppos != CODE_NOMATCH && ppos != CODE_AMBIGUOUS){
//we have a match, trim the adapter!
if(ppos == 0){
//no adapter
return false;
}else{
int sz_sqp;
int iter;
//ppos gives us the shift to the left of the query
// One case:
// ----X------- fread
// -X---- rread
// Another case:
// ---X- fread
// -X--- rread
// Another case:
// ---- fread
// -X----X- rread
//first calc rlen after the first clip
sqp->rlen -= ppos;
//now in the first two cases shown above, the other cut point is just the
//new rlen
if(sqp->rlen <= sqp->flen)
sqp->flen = sqp->rlen;
//otherwise leave sqp->flen alone
else if(sqp->rlen > sqp->flen){
// Another case:
// ---- fread
// -X----X--- rread
// make initial cut to rc read
if(use_mask){
sz_sqp = sizeof(sqp->fseq);
for(iter= sqp->flen + ppos; iter<sz_sqp && (sqp->fseq[iter] != '\0'); iter++){
sqp->fseq[iter]='N';
}
sqp->flen=iter;
sz_sqp = sizeof(sqp->rseq);
for(iter=sqp->rlen + ppos; iter<sz_sqp && (sqp->rseq[iter] != '\0'); iter++){
sqp->rseq[iter]='N';
}
sqp->rlen=iter;
}else{
sqp->rc_rqual[ppos + sqp->flen] = '\0';
sqp->rc_rseq[ppos + sqp->flen] = '\0';
}
strncpy(sqp->rseq,sqp->rc_rseq,ppos + sqp->flen+1); //move RC reads into reg place and reverse them
strncpy(sqp->rqual,sqp->rc_rqual,ppos + sqp->flen+1);
rev_qual(sqp->rqual, ppos + sqp->flen);
revcom_seq(sqp->rseq, ppos + sqp->flen);
//now we have our end cut in place in the regular reads
sqp->rlen = sqp->flen;
}
//now cases have been handled and length has been determined
if(use_mask){
sz_sqp = sizeof(sqp->fseq);
for(iter=sqp->flen; iter<sz_sqp && (sqp->fseq[iter] != '\0'); iter++){
sqp->fseq[iter]='N';
}
sqp->flen=iter;
sz_sqp = sizeof(sqp->rseq);
for(iter=sqp->rlen; iter<sz_sqp && (sqp->rseq[iter] != '\0'); iter++){
sqp->rseq[iter]='N';
}
sqp->rlen=iter;
}else{
sqp->fseq[sqp->flen] = '\0';
sqp->fqual[sqp->flen] = '\0';
sqp->rseq[sqp->rlen] = '\0';
sqp->rqual[sqp->rlen] = '\0';
}
// now re-reverse complement the sequences
strncpy(sqp->rc_rseq,sqp->rseq,sqp->rlen+1);
strncpy(sqp->rc_rqual,sqp->rqual,sqp->rlen+1);
rev_qual(sqp->rc_rqual, sqp->rlen);
revcom_seq(sqp->rc_rseq, sqp->rlen);
return true;
}
}
return false;
}
/**
* read_merge:
* Computes the potential overlap between two reads,
* fills the merged_seq items in sqp
* return true if a merging was done, and false otherwise
*/
bool read_merge(SQP sqp, size_t min_olap,
unsigned short min_match[MAX_SEQ_LEN+1],
unsigned short max_mismatch[MAX_SEQ_LEN+1],
char adj_q_cut){
//now compute overlap
int i;
char *queryseq;
char *queryqual;
char *subjseq;
char *subjqual;
int querylen = 0;
int subjlen = 0;
char c,q;
// if(sqp->rlen <= sqp->flen){
subjseq = sqp->fseq;
subjqual = sqp->fqual;
queryseq = sqp->rc_rseq;
queryqual = sqp->rc_rqual;
querylen = sqp->rlen;
subjlen = sqp->flen;
// }else{
// queryseq = sqp->fseq;
// queryqual = sqp->fqual;
// subjseq = sqp->rc_rseq;
// subjqual = sqp->rc_rqual;
// subjlen = sqp->rlen;
// querylen = sqp->flen;
// }
////////////
// Now calculate the other cases
//Round1:
// ---------- Subj
// ---------- Query
//Round2:
// ---------- Subj
// ---------- Query
//Round3:
// ---------- Subj
// ---------- Query
//...
int mpos = compute_ol(
subjseq, subjqual, subjlen,
queryseq, queryqual, querylen,
min_olap, min_match, max_mismatch,
true, adj_q_cut );
if(mpos == CODE_NOMATCH || mpos == CODE_AMBIGUOUS){
return false;
}else{
//part where subj is non-overlapping
// ---------
// -----
int pos = 0;
for(i=0;i<mpos;i++){
sqp->merged_seq[pos] = subjseq[i];
sqp->merged_qual[pos] = subjqual[i];
pos++;
}
//overlapping section
int end = min(subjlen,querylen+mpos);
for(i=mpos;i<end ;i++){
if(subjseq[i] == queryseq[i-mpos]){
c = subjseq[i];
q = match_p33_merge(subjqual[i],queryqual[i-mpos]);
}else{
q = mismatch_p33_merge(subjqual[i],queryqual[i-mpos]);
if(subjqual[i] > queryqual[i-mpos]){
c = subjseq[i];
}else{
c = queryseq[i-mpos];
}
}
sqp->merged_seq[pos] = c;
sqp->merged_qual[pos] = q;
pos++;
}
//now print either the subject or query that is remaining at the end.
if(subjlen >= querylen+mpos){ //subject is really long so it is overhanging
for(i=end;i<subjlen;i++){
sqp->merged_seq[pos] = subjseq[i];
sqp->merged_qual[pos] = subjqual[i];
pos++;
}
}else{ //normal case
for(i=end-mpos;i<querylen;i++){
sqp->merged_seq[pos] = queryseq[i];
sqp->merged_qual[pos] = queryqual[i];
pos++;
}
}
sqp->merged_len = pos;
sqp->merged_seq[pos] = '\0';
sqp->merged_qual[pos] = '\0';
sqp->mpos = mpos;
return true; //successfull merge complete!
}
return false;
}
void adapter_merge(SQP sqp, bool print_overhang){
//first RC reverse read so we can do direct overlapping
int i = 0;
int j = 0;
char c,q;
if(sqp->rlen == sqp->flen){
//easy.. peezy.. lemaon.... squeezy..
for(i=0; i< sqp->rlen; i++){
if(sqp->rc_rseq[i] == sqp->fseq[i]){
c = sqp->rc_rseq[i];
q = match_p33_merge(sqp->rc_rqual[i],sqp->fqual[i]);
}else{
q = mismatch_p33_merge(sqp->rc_rqual[i],sqp->fqual[i]);
if(sqp->rc_rqual[i]>sqp->fqual[i]){
c = sqp->rc_rseq[i];
}else{
c = sqp->fseq[i];
}
}
sqp->merged_seq[i] = c;
sqp->merged_qual[i] = q;
}
sqp->merged_len = sqp->rlen;
sqp->merged_qual[i] = '\0';
sqp->merged_seq[i] = '\0';
sqp->mpos = 0;
}else{
int num_match = 0;
int max_match = 0;
int max_offset = 0;
char *queryseq;
char *queryqual;
char *subjseq;
char *subjqual;
int querylen = 0;
int subjlen = 0;
int ndiff = 0;
if(sqp->flen > sqp->rlen){
ndiff = sqp->flen - sqp->rlen;
subjseq = sqp->fseq;
subjqual = sqp->fqual;
queryseq = sqp->rc_rseq;
queryqual = sqp->rc_rqual;
querylen = sqp->rlen;
subjlen = sqp->flen;
}else{
ndiff = sqp->rlen - sqp->flen;
subjseq = sqp->rc_rseq;
subjqual = sqp->rc_rqual;
queryseq = sqp->fseq;
queryqual = sqp->fqual;
querylen = sqp->flen;
subjlen = sqp->rlen;
}
for(i=0;i<=ndiff;i++){
num_match = 0;
for(j=0;j<querylen;j++){
if(subjseq[i+j] == queryseq[j])
num_match++;
}
if(num_match>max_match){
max_offset = i;
max_match = num_match;
}
}//end for
//now we have our best offset, use that and build our merged_sequence
int pos = 0;
if(print_overhang){
for(i=0;i<max_offset;i++){
sqp->merged_seq[pos] = subjseq[i];
sqp->merged_qual[pos] = subjqual[i];
pos++;
}
}
//now do the part that overlaps
for(i=max_offset;i<querylen+max_offset;i++){
if(subjseq[i] == queryseq[i-max_offset]){
c = subjseq[i];
q = match_p33_merge(subjqual[i],queryqual[i-max_offset]);
}else{
q = mismatch_p33_merge(subjqual[i],queryqual[i-max_offset]);
if(subjqual[i] > queryqual[i-max_offset]){
c = subjseq[i];
}else{
c = queryseq[i-max_offset];
}
}
sqp->merged_seq[pos] = c;
sqp->merged_qual[pos] = q;
pos++;
}
//finish off the subject sequence
if(print_overhang){
for(i=(querylen+max_offset); i<subjlen; i++){
sqp->merged_seq[pos] = subjseq[i];
sqp->merged_qual[pos] = subjqual[i];
pos++;
}
}
sqp->merged_seq[pos]='\0';
sqp->merged_qual[pos]='\0';
sqp->merged_len = pos;
sqp->mpos = max_offset;
}//end case where we need to find the best merging
}
/* next_fastqs
Read the next forward and reverse fastq sequences.
Check to make sure their ID's are compatible and
put the results in the next SQP of SQPDB. Grow
this, if necessary.
*/
bool next_fastqs( gzFile ffq, gzFile rfq, SQP curr_sqp, bool p64 ) {
int frs; // forward fastq read status
int rrs; // reverse fastq read status
size_t id1len = 0;
size_t id2len = 0;
/* Read the next fastq record from the forward and reverse
pair of each */
//make sure everything is fresh...
memset(curr_sqp->fid,'\0',MAX_SEQ_LEN);
memset(curr_sqp->rid,'\0',MAX_SEQ_LEN);
memset(curr_sqp->fseq,'\0',MAX_SEQ_LEN);
memset(curr_sqp->rseq,'\0',MAX_SEQ_LEN);
memset(curr_sqp->rc_rseq,'\0',MAX_SEQ_LEN);
memset(curr_sqp->fqual,'\0',MAX_SEQ_LEN);
memset(curr_sqp->rqual,'\0',MAX_SEQ_LEN);
memset(curr_sqp->merged_seq,'\0',MAX_SEQ_LEN+MAX_SEQ_LEN);
memset(curr_sqp->merged_qual,'\0',MAX_SEQ_LEN+MAX_SEQ_LEN);
memset(curr_sqp->rc_rqual,'\0',MAX_SEQ_LEN);
curr_sqp->flen = curr_sqp->rlen = 0;
//
frs = read_fastq( ffq, curr_sqp->fid, curr_sqp->fseq,
curr_sqp->fqual, &id1len, &(curr_sqp->flen), p64 );
rrs = read_fastq( rfq, curr_sqp->rid, curr_sqp->rseq,
curr_sqp->rqual, &id2len, &(curr_sqp->rlen), p64 );
// //reverse comp the second read for overlapping and everything.
// strcpy(curr_sqp->rc_rseq,curr_sqp->rseq);
// strcpy(curr_sqp->rc_rqual,curr_sqp->rqual);
// revcom_seq(curr_sqp->rc_rseq,curr_sqp->rlen);
// rev_qual(curr_sqp->rc_rqual,curr_sqp->rlen);
if ( (frs == 1) &&
(rrs == 1) &&
f_r_id_check( curr_sqp->fid, id1len, curr_sqp->rid, id2len ) ) {
strncpy(curr_sqp->rc_rseq,curr_sqp->rseq,curr_sqp->rlen+1);
strncpy(curr_sqp->rc_rqual,curr_sqp->rqual,curr_sqp->rlen+1);
rev_qual(curr_sqp->rc_rqual, curr_sqp->rlen);
revcom_seq(curr_sqp->rc_rseq, curr_sqp->rlen);
return true;
} else {
return false;
}
}
int write_fastq(gzFile out, char id[], char seq[], char qual[]){
return gzprintf(out,"@%s\n%s\n+\n%s\n", id, seq, qual);
}
bool f_r_id_check( char fid[], size_t fid_len, char rid[], size_t rid_len ) {
if(fid_len != rid_len){
goto bad_read;
//}else if (strncmp( fid, rid, fid_len - 2) == 0 ) {
}else{
return true;
}
bad_read:
fprintf(stderr,"ERROR: Fastq id lines do not match: %s vs %s \n", fid, rid);
return false;
}
/* read_fastq
Return 1 => more sequence to be had
0 => EOF
*/
int read_fastq( gzFile fastq, char id[], char seq[], char qual[], size_t *id_len, size_t *seq_len, bool p64 ) {
char c;
size_t i;
c = gzgetc( fastq );
if ( c == EOF ) return 0;
if ( c != '@' ) {
fprintf( stderr, "fastq record not beginning with @\n" );
return 0;
}
/* get identifier */
i = 0;
c = gzgetc( fastq );
while( c != '\n' &&
(i < MAX_ID_LEN)) {
if ( c == EOF ) {
return 0;
}
id[i] = c;
i++;
if ( i == MAX_ID_LEN ) {
/* Id is too long - truncate it now */
id[i] = '\0';
}
c = gzgetc( fastq );
}
id[i] = '\0';
*id_len = i;
/* Now, everything else on the line is description (if anything)
although fastq does not appear to formally support description */
// while ( (c != '\n') &&
// (c != EOF) ) {
// c = gzgetc( fastq );
// }
/* Now, read the sequence. This should all be on a single line */
i = 0;
c = gzgetc( fastq );
while ( (c != '\n') &&
(c != EOF) &&
(i < MAX_SEQ_LEN) ) {
if ( isspace(c) ) {
;
}
else {
c = toupper( c );
seq[i++] = (c=='.' ? 'N':c);
}
c = gzgetc( fastq );
}
seq[i] = '\0';
*seq_len = i;
/* If the reading stopped because the sequence was longer than
INIT_ALN_SEQ_LEN, then we need to advance the file pointer
past this line */
if ( i == MAX_SEQ_LEN ) {
while ( (c != '\n') &&
(c != EOF) ) {
c = gzgetc( fastq );
}
}
/* Now, read the quality score header */
c = gzgetc( fastq );
if ( c != '+' ) {
fprintf( stderr, "Problem reading quality line for %s\n", id );
return 1;
}
/* Zip through the rest of the line, it should be the same identifier
as before or blank */
c = gzgetc( fastq );
while( (c != '\n') &&
(c != EOF) ) {
c = gzgetc( fastq );
}
/* Now, get the quality score line */
c = gzgetc( fastq );
i = 0;
while( (c != '\n') &&
(c != EOF) &&
(i < MAX_SEQ_LEN) ) {
if ( isspace(c) ) {
;
}
else {
qual[i++] = (p64)?((c=='B')?'!':c-31):c;
}
c = gzgetc( fastq );
}
qual[i] = '\0';
/* If the reading stopped because the sequence was longer than
INIT_ALN_SEQ_LEN, then we need to advance the file pointer
past this line */
if ( i == MAX_SEQ_LEN ) {
while ( (c != '\n') &&
(c != EOF) ) {
c = gzgetc( fastq );
}
}
if ( c == EOF ) {
fprintf(stderr,"\nWarning: Your last read may have been discarded because you are missing a new line at the end of the file.\n\n");
return 0;
}
return 1;
}
/** fileOpen **/
gzFile fileOpen(const char *name, char access_mode[]) {
gzFile f;
f = gzopen(name, access_mode);
if (f == Z_NULL) {
fprintf( stderr, "%s\n", name);
perror("Cannot open file");
return Z_NULL;
}
return f;
}
/*
Supply two sequences in the proper orientation for overlap
Ie in this example give compute_ol the reversed sequence and quality