-
Notifications
You must be signed in to change notification settings - Fork 382
Expand file tree
/
Copy pathadaptertrimmer.cpp
More file actions
164 lines (138 loc) · 5.43 KB
/
Copy pathadaptertrimmer.cpp
File metadata and controls
164 lines (138 loc) · 5.43 KB
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
#include "adaptertrimmer.h"
AdapterTrimmer::AdapterTrimmer(){
}
AdapterTrimmer::~AdapterTrimmer(){
}
bool AdapterTrimmer::trimByOverlapAnalysis(Read* r1, Read* r2, FilterResult* fr, int diffLimit, int overlapRequire, double diffPercentLimit) {
OverlapResult ov = OverlapAnalysis::analyze(r1, r2, diffLimit, overlapRequire, diffPercentLimit);
return trimByOverlapAnalysis(r1, r2, fr, ov);
}
bool AdapterTrimmer::trimByOverlapAnalysis(Read* r1, Read* r2, FilterResult* fr, OverlapResult ov, int frontTrimmed1, int frontTrimmed2) {
int ol = ov.overlap_len;
if(ov.overlapped && ov.offset < 0) {
//5' ......frontTrimmed1......|------------------------------------------|----- 3'
//3' -----|-------------------------------------------|......frontTrimmed2..... 5'
int len1 = min(r1->length(), ol + frontTrimmed2);
int len2 = min(r2->length(), ol + frontTrimmed1);
string adapter1 = r1->mSeq.mStr.substr(len1, r1->length() - len1);
string adapter2 = r2->mSeq.mStr.substr(len2, r2->length() - len2);
if(_DEBUG) {
cerr << adapter1 << endl;
cerr << adapter2 << endl;
cerr << "frontTrimmed2: " << frontTrimmed1 << endl;
cerr << "frontTrimmed2: " << frontTrimmed2 << endl;
cerr << "overlap:" << ov.offset << "," << ov.overlap_len << ", " << ov.diff << endl;
r1->print();
r2->reverseComplement()->print();
cerr <<endl;
}
r1->mSeq.mStr = r1->mSeq.mStr.substr(0, len1);
r1->mQuality = r1->mQuality.substr(0, len1);
r2->mSeq.mStr = r2->mSeq.mStr.substr(0, len2);
r2->mQuality = r2->mQuality.substr(0, len2);
fr->addAdapterTrimmed(adapter1, adapter2);
return true;
}
return false;
}
bool AdapterTrimmer::trimByMultiSequences(Read* r, FilterResult* fr, vector<string>& adapterList, bool isR2, int allowOneMismatchForEach, bool incTrimmedCounter) {
int matchReq = 4;
if(adapterList.size() > 16)
matchReq = 5;
if(adapterList.size() > 256)
matchReq = 6;
bool trimmed = false;
string originalSeq = r->mSeq.mStr;
for(int i=0; i<adapterList.size(); i++) {
trimmed |= trimBySequence(r, NULL, adapterList[i], isR2, matchReq);
}
if(trimmed) {
string adapter = originalSeq.substr(r->length(), originalSeq.length() - r->length());
if(fr)
fr->addAdapterTrimmed(adapter, isR2, incTrimmedCounter);
else
cerr << adapter << endl;
}
return trimmed;
}
bool AdapterTrimmer::trimBySequence(Read* r, FilterResult* fr, string& adapterseq, bool isR2, int allowOneMismatchForEach, int matchReq) {
int rlen = r->length();
int alen = adapterseq.length();
const char* adata = adapterseq.c_str();
const char* rdata = r->mSeq.mStr.c_str();
if(alen < matchReq)
return false;
int pos=0;
bool found = false;
int start = 0;
if(alen >= 16)
start = -4;
else if(alen >= 12)
start = -3;
else if(alen >= 8)
start = -2;
// we start from negative numbers since the Illumina adapter dimer usually have the first A skipped as A-tailing
for(pos = start; pos<rlen-matchReq; pos++) {
int cmplen = min(rlen - pos, alen);
int allowedMismatch = cmplen/allowOneMismatchForEach;
int mismatch = 0;
bool matched = true;
for(int i=max(0, -pos); i<cmplen; i++) {
if( adata[i] != rdata[i+pos] ){
mismatch++;
if(mismatch > allowedMismatch) {
matched = false;
break;
}
}
}
if(matched) {
found = true;
break;
}
}
if(found) {
if(pos < 0) {
string adapter = adapterseq.substr(0, alen+pos);
r->mSeq.mStr.resize(0);
r->mQuality.resize(0);
if(fr) {
fr->addAdapterTrimmed(adapter, isR2);
}
} else {
string adapter = r->mSeq.mStr.substr(pos, rlen-pos);
r->mSeq.mStr = r->mSeq.mStr.substr(0, pos);
r->mQuality = r->mQuality.substr(0, pos);
if(fr) {
fr->addAdapterTrimmed(adapter, isR2);
}
}
return true;
}
return false;
}
bool AdapterTrimmer::test() {
Read r("@name",
"TTTTAACCCCCCCCCCCCCCCCCCCCCCCCCCCCAATTTTAAAATTTTCCCCGGGG",
"+",
"///EEEEEEEEEEEEEEEEEEEEEEEEEE////EEEEEEEEEEEEE////E////E");
string adapter = "TTTTCCACGGGGATACTACTG";
bool trimmed = AdapterTrimmer::trimBySequence(&r, NULL, adapter);
if (r.mSeq.mStr != "TTTTAACCCCCCCCCCCCCCCCCCCCCCCCCCCCAATTTTAAAA")
return false;
Read read("@name",
"TTTTAACCCCCCCCCCCCCCCCCCCCCCCCCCCCAATTTTAAAATTTTCCCCGGGGAAATTTCCCGGGAAATTTCCCGGGATCGATCGATCGATCGAATTCC",
"+",
"///EEEEEEEEEEEEEEEEEEEEEEEEEE////EEEEEEEEEEEEE////E////EEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE");
vector<string> adapterList;
adapterList.push_back("GCTAGCTAGCTAGCTA");
adapterList.push_back("AAATTTCCCGGGAAATTTCCCGGG");
adapterList.push_back("ATCGATCGATCGATCG");
adapterList.push_back("AATTCCGGAATTCCGG");
trimmed = AdapterTrimmer::trimByMultiSequences(&read, NULL, adapterList);
if (read.mSeq.mStr != "TTTTAACCCCCCCCCCCCCCCCCCCCCCCCCCCCAATTTTAAAATTTTCCCCGGGG") {
cerr << read.mSeq.mStr << endl;
return false;
}
return true;
}