1 #ifndef Mothur_makecontigscommand_h
2 #define Mothur_makecontigscommand_h
5 // makecontigscommand.h
8 // Created by Sarah Westcott on 5/15/12.
9 // Copyright (c) 2012 Schloss Lab. All rights reserved.
12 #include "command.hpp"
13 #include "sequence.hpp"
14 #include "qualityscores.h"
15 #include "alignment.hpp"
16 #include "gotohoverlap.hpp"
17 #include "needlemanoverlap.hpp"
18 #include "blastalign.hpp"
19 #include "noalign.hpp"
20 #include "trimoligos.h"
27 fastqRead() { name = ""; sequence = ""; scores.clear(); };
28 fastqRead(string n, string s, vector<int> sc) : name(n), sequence(s), scores(sc) {};
32 struct pairFastqRead {
37 pairFastqRead(fastqRead f, fastqRead r) : forward(f), reverse(r){};
40 /**************************************************************************************************/
42 class MakeContigsCommand : public Command {
44 MakeContigsCommand(string);
46 ~MakeContigsCommand(){}
48 vector<string> setParameters();
49 string getCommandName() { return "make.contigs"; }
50 string getCommandCategory() { return "Sequence Processing"; }
51 //commmand category choices: Sequence Processing, OTU-Based Approaches, Hypothesis Testing, Phylotype Analysis, General, Clustering and Hidden
53 string getHelpString();
54 string getOutputPattern(string);
55 string getCitation() { return "http://www.mothur.org/wiki/Make.contigs"; }
56 string getDescription() { return "description"; }
59 void help() { m->mothurOut(getHelpString()); }
62 bool abort, allFiles, createGroup;
63 string outputDir, ffastqfile, rfastqfile, align, oligosfile, rfastafile, ffastafile, rqualfile, fqualfile, file;
64 float match, misMatch, gapOpen, gapExtend;
65 int processors, longestBase, threshold, tdiffs, bdiffs, pdiffs, ldiffs, sdiffs;
66 vector<string> outputNames;
68 map<int, oligosPair> barcodes;
69 map<int, oligosPair> primers;
70 vector<string> linker;
71 vector<string> spacer;
72 vector<string> primerNameVector;
73 vector<string> barcodeNameVector;
75 map<string, int> groupCounts;
76 map<string, string> groupMap;
77 //map<string, int> combos;
78 //map<string, int> groupToIndex;
79 //vector<string> groupVector;
81 fastqRead readFastq(ifstream&, bool&);
82 vector< vector<string> > readFastqFiles(unsigned long int&);
83 bool checkReads(fastqRead&, fastqRead&);
84 int createProcesses(vector< vector<string> >, string, string, string, string, string, vector<vector<string> >, vector<vector<string> >);
85 int driver(vector<string>, string, string, string, string, string, vector<vector<string> >, vector<vector<string> >);
86 bool getOligos(vector<vector<string> >&, vector<vector<string> >&);
87 string reverseOligo(string);
88 vector<pairFastqRead> getReads(bool ignoref, bool ignorer, fastqRead forward, fastqRead reverse, map<string, fastqRead>& uniques);
91 /**************************************************************************************************/
93 /**************************************************************************************************/
94 //custom data structure for threads to use.
95 // This is passed by void pointer so it can be any data type
96 // that can be passed using a single void pointer (LPVOID).
100 string outputScrapFasta;
101 string outputScrapQual;
102 string outputMisMatches;
104 vector<string> files;
105 vector<vector<string> > fastaFileNames;
106 vector<vector<string> > qualFileNames;
108 float match, misMatch, gapOpen, gapExtend;
109 int count, threshold, threadID, pdiffs, bdiffs, tdiffs;
110 bool allFiles, createGroup;
111 map<string, int> groupCounts;
112 map<string, string> groupMap;
113 vector<string> primerNameVector;
114 vector<string> barcodeNameVector;
115 map<int, oligosPair> barcodes;
116 map<int, oligosPair> primers;
119 contigsData(vector<string> f, string of, string oq, string osf, string osq, string om, string al, MothurOut* mout, float ma, float misMa, float gapO, float gapE, int thr, map<int, oligosPair> br, map<int, oligosPair> pr, vector<vector<string> > ffn, vector<vector<string> > qfn, vector<string>bnv, vector<string> pnv, int pdf, int bdf, int tdf, bool cg, bool all, int tid) {
123 outputMisMatches = om;
132 outputScrapFasta = osf;
133 outputScrapQual = osq;
134 fastaFileNames = ffn;
138 barcodeNameVector = bnv;
139 primerNameVector = pnv;
149 /**************************************************************************************************/
150 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux) || (__linux__) || (__unix__) || (__unix)
152 static DWORD WINAPI MyContigsThreadFunction(LPVOID lpParam){
153 contigsData* pDataArray;
154 pDataArray = (contigsData*)lpParam;
157 int longestBase = 1000;
158 Alignment* alignment;
159 if(pDataArray->align == "gotoh") { alignment = new GotohOverlap(pDataArray->gapOpen, pDataArray->gapExtend, pDataArray->match, pDataArray->misMatch, longestBase); }
160 else if(pDataArray->align == "needleman") { alignment = new NeedlemanOverlap(pDataArray->gapOpen, pDataArray->match, pDataArray->misMatch, longestBase); }
163 string thisffastafile = pDataArray->files[0];
164 string thisfqualfile = pDataArray->files[1];
165 string thisrfastafile = pDataArray->files[2];
166 string thisrqualfile = pDataArray->files[3];
168 if (pDataArray->m->debug) { pDataArray->m->mothurOut("[DEBUG]: ffasta = " + thisffastafile + ".\n[DEBUG]: fqual = " + thisfqualfile + ".\n[DEBUG]: rfasta = " + thisrfastafile + ".\n[DEBUG]: rqual = " + thisrqualfile + ".\n"); }
170 if(pDataArray->allFiles){
171 for (int i = 0; i < pDataArray->fastaFileNames.size(); i++) { //clears old file
172 for (int j = 0; j < pDataArray->fastaFileNames[i].size(); j++) { //clears old file
173 if (pDataArray->fastaFileNames[i][j] != "") {
175 pDataArray->m->openOutputFile(pDataArray->fastaFileNames[i][j], temp); temp.close();
176 pDataArray->m->openOutputFile(pDataArray->qualFileNames[i][j], temp); temp.close();
182 ifstream inFFasta, inRFasta, inFQual, inRQual;
183 pDataArray->m->openInputFile(thisffastafile, inFFasta);
184 pDataArray->m->openInputFile(thisfqualfile, inFQual);
185 pDataArray->m->openInputFile(thisrfastafile, inRFasta);
186 pDataArray->m->openInputFile(thisrqualfile, inRQual);
188 ofstream outFasta, outQual, outMisMatch, outScrapFasta, outScrapQual;
189 pDataArray->m->openOutputFile(pDataArray->outputFasta, outFasta);
190 pDataArray->m->openOutputFile(pDataArray->outputQual, outQual);
191 pDataArray->m->openOutputFile(pDataArray->outputMisMatches, outMisMatch);
192 pDataArray->m->openOutputFile(pDataArray->outputScrapFasta, outScrapFasta);
193 pDataArray->m->openOutputFile(pDataArray->outputScrapQual, outScrapQual);
194 outMisMatch << "Name\tLength\tMisMatches\n";
196 TrimOligos trimOligos(pDataArray->pdiffs, pDataArray->bdiffs, 0, 0, pDataArray->primers, pDataArray->barcodes);
198 while ((!inFQual.eof()) && (!inFFasta.eof()) && (!inRFasta.eof()) && (!inRQual.eof())) {
200 if (pDataArray->m->control_pressed) { break; }
203 string trashCode = "";
204 int currentSeqsDiffs = 0;
206 //read seqs and quality info
207 Sequence fSeq(inFFasta); pDataArray->m->gobble(inFFasta);
208 Sequence rSeq(inRFasta); pDataArray->m->gobble(inRFasta);
209 QualityScores fQual(inFQual); pDataArray->m->gobble(inFQual);
210 QualityScores rQual(inRQual); pDataArray->m->gobble(inRQual);
212 int barcodeIndex = 0;
215 if(pDataArray->barcodes.size() != 0){
216 success = trimOligos.stripBarcode(fSeq, rSeq, fQual, rQual, barcodeIndex);
217 if(success > pDataArray->bdiffs) { trashCode += 'b'; }
218 else{ currentSeqsDiffs += success; }
221 if(pDataArray->primers.size() != 0){
222 success = trimOligos.stripForward(fSeq, rSeq, fQual, rQual, primerIndex);
223 if(success > pDataArray->pdiffs) { trashCode += 'f'; }
224 else{ currentSeqsDiffs += success; }
227 if (currentSeqsDiffs > pDataArray->tdiffs) { trashCode += 't'; }
229 //flip the reverse reads
230 rSeq.reverseComplement();
234 alignment->align(fSeq.getUnaligned(), rSeq.getUnaligned());
235 map<int, int> ABaseMap = alignment->getSeqAAlnBaseMap();
236 map<int, int> BBaseMap = alignment->getSeqBAlnBaseMap();
237 fSeq.setAligned(alignment->getSeqAAln());
238 rSeq.setAligned(alignment->getSeqBAln());
239 int length = fSeq.getAligned().length();
241 //traverse alignments merging into one contiguous seq
243 vector<int> contigScores;
244 int numMismatches = 0;
245 string seq1 = fSeq.getAligned();
246 string seq2 = rSeq.getAligned();
247 vector<int> scores1 = fQual.getQualityScores();
248 vector<int> scores2 = rQual.getQualityScores();
250 int overlapStart = fSeq.getStartPos();
251 int seq2Start = rSeq.getStartPos();
252 //bigger of the 2 starting positions is the location of the overlapping start
253 if (overlapStart < seq2Start) { //seq2 starts later so take from 0 to seq2Start from seq1
254 overlapStart = seq2Start;
255 for (int i = 0; i < overlapStart; i++) {
257 contigScores.push_back(scores1[ABaseMap[i]]);
259 }else { //seq1 starts later so take from 0 to overlapStart from seq2
260 for (int i = 0; i < overlapStart; i++) {
262 contigScores.push_back(scores2[BBaseMap[i]]);
266 int seq1End = fSeq.getEndPos();
267 int seq2End = rSeq.getEndPos();
268 int overlapEnd = seq1End;
269 if (seq2End < overlapEnd) { overlapEnd = seq2End; } //smallest end position is where overlapping ends
271 for (int i = overlapStart; i < overlapEnd; i++) {
272 if (seq1[i] == seq2[i]) { //match, add base and choose highest score
274 contigScores.push_back(scores1[ABaseMap[i]]);
275 if (scores1[ABaseMap[i]] < scores2[BBaseMap[i]]) { contigScores[contigScores.size()-1] = scores2[BBaseMap[i]]; }
276 }else if (((seq1[i] == '.') || (seq1[i] == '-')) && ((seq2[i] != '-') && (seq2[i] != '.'))) { //seq1 is a gap and seq2 is a base, choose seq2, unless quality score for base is below threshold. In that case eliminate base
277 if (scores2[BBaseMap[i]] < pDataArray->threshold) { } //
280 contigScores.push_back(scores2[BBaseMap[i]]);
282 }else if (((seq2[i] == '.') || (seq2[i] == '-')) && ((seq1[i] != '-') && (seq1[i] != '.'))) { //seq2 is a gap and seq1 is a base, choose seq1, unless quality score for base is below threshold. In that case eliminate base
283 if (scores1[ABaseMap[i]] < pDataArray->threshold) { } //
286 contigScores.push_back(scores1[ABaseMap[i]]);
288 }else if (((seq1[i] != '-') && (seq1[i] != '.')) && ((seq2[i] != '-') && (seq2[i] != '.'))) { //both bases choose one with better quality
290 contigScores.push_back(scores1[ABaseMap[i]]);
291 if (scores1[ABaseMap[i]] < scores2[BBaseMap[i]]) { contigScores[contigScores.size()-1] = scores2[BBaseMap[i]]; c = seq2[i]; }
294 }else { //should never get here
295 pDataArray->m->mothurOut("[ERROR]: case I didn't think of seq1 = " + toString(seq1[i]) + " and seq2 = " + toString(seq2[i]) + "\n");
299 if (seq1End < seq2End) { //seq1 ends before seq2 so take from overlap to length from seq2
300 for (int i = overlapEnd; i < length; i++) {
302 contigScores.push_back(scores2[BBaseMap[i]]);
304 }else { //seq2 ends before seq1 so take from overlap to length from seq1
305 for (int i = overlapEnd; i < length; i++) {
307 contigScores.push_back(scores1[ABaseMap[i]]);
312 if(trashCode.length() == 0){
313 if (pDataArray->createGroup) {
314 if(pDataArray->barcodes.size() != 0){
315 string thisGroup = pDataArray->barcodeNameVector[barcodeIndex];
316 if (pDataArray->primers.size() != 0) {
317 if (pDataArray->primerNameVector[primerIndex] != "") {
318 if(thisGroup != "") {
319 thisGroup += "." + pDataArray->primerNameVector[primerIndex];
321 thisGroup = pDataArray->primerNameVector[primerIndex];
326 if (pDataArray->m->debug) { pDataArray->m->mothurOut(", group= " + thisGroup + "\n"); }
328 pDataArray->groupMap[fSeq.getName()] = thisGroup;
330 map<string, int>::iterator it = pDataArray->groupCounts.find(thisGroup);
331 if (it == pDataArray->groupCounts.end()) { pDataArray->groupCounts[thisGroup] = 1; }
332 else { pDataArray->groupCounts[it->first] ++; }
337 if(pDataArray->allFiles){
339 pDataArray->m->openOutputFileAppend(pDataArray->fastaFileNames[barcodeIndex][primerIndex], output);
340 output << ">" << fSeq.getName() << endl << contig << endl;
343 pDataArray->m->openOutputFileAppend(pDataArray->qualFileNames[barcodeIndex][primerIndex], output);
344 output << ">" << fSeq.getName() << endl;
345 for (int i = 0; i < contigScores.size(); i++) { output << contigScores[i] << ' '; }
351 outFasta << ">" << fSeq.getName() << endl << contig << endl;
352 outQual << ">" << fSeq.getName() << endl;
353 for (int i = 0; i < contigScores.size(); i++) { outQual << contigScores[i] << ' '; }
355 outMisMatch << fSeq.getName() << '\t' << contig.length() << '\t' << numMismatches << endl;
358 outScrapFasta << ">" << fSeq.getName() << " | " << trashCode << endl << contig << endl;
359 outScrapQual << ">" << fSeq.getName() << " | " << trashCode << endl;
360 for (int i = 0; i < contigScores.size(); i++) { outScrapQual << contigScores[i] << ' '; }
361 outScrapQual << endl;
366 if((num) % 1000 == 0){ pDataArray->m->mothurOut(toString(num)); pDataArray->m->mothurOutEndLine(); }
370 if((num) % 1000 != 0){ pDataArray->m->mothurOut(toString(num)); pDataArray->m->mothurOutEndLine(); }
379 outScrapFasta.close();
380 outScrapQual.close();
383 if (pDataArray->m->control_pressed) { pDataArray->m->mothurRemove(pDataArray->outputQual); pDataArray->m->mothurRemove(pDataArray->outputFasta); pDataArray->m->mothurRemove(pDataArray->outputMisMatches); pDataArray->m->mothurRemove(pDataArray->outputScrapQual); pDataArray->m->mothurRemove(pDataArray->outputScrapFasta);}
388 catch(exception& e) {
389 pDataArray->m->errorOut(e, "AlignCommand", "MyContigsThreadFunction");