File: smithwaterman.cpp

package info (click to toggle)
libsmithwaterman 0.0+git20160702.2610e25-11
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 296 kB
  • sloc: cpp: 2,115; makefile: 59; sh: 16
file content (306 lines) | stat: -rw-r--r-- 9,348 bytes parent folder | download | duplicates (5)
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
#include <iostream>
#include <string.h>
#include <string>
#include <sstream>
#include <getopt.h>
#include <utility>
#include <vector>
#include <stdlib.h>
#include "SmithWatermanGotoh.h"
#include "BandedSmithWaterman.h"

using namespace std;

/* Returns the Reverse Complement of a DNA Sequence, from the alphabet {A,T,C,G,N} */
string reverseComplement(string read) {
	
	// Declare the (empty) reverse complement read as a string
	string rc_read;	
	
	// Reverse Read
	rc_read.assign(read.rbegin(), read.rend());
	
	// Complement.  Note that not IUPAC compliant. Uses the alphabet {A,T,C,G,N}
	string::iterator t;
	for (t = rc_read.begin(); t != rc_read.end(); ++t) {
		switch (*t) {
			case 'A':
				*t = 'T';
				break;
			case 'T':
				*t = 'A';
				break;
			case 'C':
				*t = 'G';
				break;
			case 'G':
				*t = 'C';
				break;
			case 'N':
				*t = 'N';
				break;
			default:
				cout << "Unknown Nucleotide!";
				break;
		}
	}
	
	// Return the Read  (faster if done through pointers?)
	return rc_read;
}


void printSummary(void) {
    cerr << "usage: smithwaterman [options] <reference sequence> <query sequence>" << endl
         << endl
         << "options:" << endl 
         << "    -m, --match-score         the match score (default 10.0)" << endl
         << "    -n, --mismatch-score      the mismatch score (default -9.0)" << endl
         << "    -g, --gap-open-penalty    the gap open penalty (default 15.0)" << endl
         << "    -z, --entropy-gap-open-penalty  enable entropy scaling of the gap open penalty" << endl
         << "    -e, --gap-extend-penalty  the gap extend penalty (default 6.66)" << endl
         << "    -r, --repeat-gap-extend-penalty  use repeat information when generating gap extension penalties" << endl
         << "    -b, --bandwidth           bandwidth to use (default 0, or non-banded algorithm)" << endl
         << "    -p, --print-alignment     print out the alignment" << endl
         << "    -R, --reverse-complement  report the reverse-complement alignment if it scores better" << endl
         << endl
         << "When called with literal reference and query sequences, smithwaterman" << endl
         << "prints the cigar match positional string and the match position for the" << endl
         << "query sequence against the reference sequence." << endl;
}


int main (int argc, char** argv) {

    int c;

    string reference;
    string query;

    int bandwidth = 0;

    float matchScore = 10.0f;
    float mismatchScore = -9.0f;
    float gapOpenPenalty = 15.0f;
    float gapExtendPenalty = 6.66f;
    float entropyGapOpenPenalty = 0.0f;
    bool useRepeatGapExtendPenalty = false;
    float repeatGapExtendPenalty = 1.0f;
    
    bool print_alignment = false;
    bool tryReverseComplement = false;

    while (true) {
        static struct option long_options[] =
            {
                {"help", no_argument, 0, 'h'},
                {"match-score",  required_argument, 0, 'm'},
                {"mismatch-score",  required_argument, 0, 'n'},
                {"gap-open-penalty",  required_argument, 0, 'g'},
                {"entropy-gap-open-penalty",  required_argument, 0, 'z'},
                {"gap-extend-penalty",  required_argument, 0, 'e'},
                {"repeat-gap-extend-penalty",  required_argument, 0, 'r'},
                {"print-alignment",  required_argument, 0, 'p'},
                {"bandwidth", required_argument, 0, 'b'},
                {"reverse-complement", no_argument, 0, 'R'},
                {0, 0, 0, 0}
            };
        int option_index = 0;

        c = getopt_long (argc, argv, "hpRzm:n:g:r:e:b:r:",
                         long_options, &option_index);

        if (c == -1)
            break;
 
        switch (c)
        {
        case 0:
            /* If this option set a flag, do nothing else now. */
            if (long_options[option_index].flag != 0)
                break;
            printf ("option %s", long_options[option_index].name);
            if (optarg)
                printf (" with arg %s", optarg);
            printf ("\n");
            break;

        case 'R':
            tryReverseComplement = true;
            break;

        case 'm':
            matchScore = atof(optarg);
            break;
 
        case 'n':
            mismatchScore = atof(optarg);
            break;
 
        case 'g':
            gapOpenPenalty = atof(optarg);
            break;

        case 'z':
            entropyGapOpenPenalty = 1;
            break;
 
        case 'r':
            useRepeatGapExtendPenalty = true;
            repeatGapExtendPenalty = atof(optarg);
            break;
 
        case 'e':
            gapExtendPenalty = atof(optarg);
            break;

        case 'b':
            bandwidth = atoi(optarg);
            break;

        case 'p':
            print_alignment = true;
            break;
 
        case 'h':
            printSummary();
            exit(0);
            break;
 
        case '?':
            /* getopt_long already printed an error message. */
            printSummary();
            exit(1);
            break;
 
        default:
            abort ();
        }
    }

    /* Print any remaining command line arguments (not options). */
    if (optind == argc - 2) {
        //cerr << "fasta file: " << argv[optind] << endl;
        reference = string(argv[optind]);
        ++optind;
        query = string(argv[optind]);
    } else {
        cerr << "please specify a reference and query sequence" << endl
             << "execute " << argv[0] << " --help for command-line usage" << endl;
        exit(1);
    }

    // initialize
	
    unsigned int referencePos;
    string cigar;

    float bestScore = 0;

    bool alignedReverse = false;

    // create a new Smith-Waterman alignment object
    if (bandwidth > 0) {
        pair< pair<unsigned int, unsigned int>, pair<unsigned int, unsigned int> > hr;
        hr.first.first   = 2;
        hr.first.second  = 18;
        hr.second.first  = 1;
        hr.second.second = 17;
        CBandedSmithWaterman bsw(matchScore, mismatchScore, gapOpenPenalty, gapExtendPenalty, bandwidth);
        bsw.Align(referencePos, cigar, reference, query, hr);
    } else {
        CSmithWatermanGotoh sw(matchScore, mismatchScore, gapOpenPenalty, gapExtendPenalty);
        if (useRepeatGapExtendPenalty)
            sw.EnableRepeatGapExtensionPenalty(repeatGapExtendPenalty);
        if (entropyGapOpenPenalty > 0)
            sw.EnableEntropyGapPenalty(entropyGapOpenPenalty);
        sw.Align(referencePos, cigar, reference, query);
        bestScore = sw.BestScore;
        if (tryReverseComplement) {
            string queryRevC = reverseComplement(query);
            sw.Align(referencePos, cigar, reference, query);
            if (sw.BestScore > bestScore) {
                alignedReverse = true;
                bestScore = sw.BestScore;
                query = queryRevC;
            }
        }
    }
 
    printf("%s %3u %f %s\n", cigar.c_str(), referencePos, bestScore, (alignedReverse ? "-" : "+"));

    // optionally print out the alignment
    if (print_alignment) {
        int alignmentLength = 0;
        int len;
        string slen;
        vector<pair<int, char> > cigarData;
        for (string::iterator c = cigar.begin(); c != cigar.end(); ++c) {
            switch (*c) {
            case 'I':
                len = atoi(slen.c_str());
                slen.clear();
                cigarData.push_back(make_pair(len, *c));
                break;
            case 'D':
                len = atoi(slen.c_str());
                alignmentLength += len;
                slen.clear();
                cigarData.push_back(make_pair(len, *c));
                break;
            case 'M':
                len = atoi(slen.c_str());
                alignmentLength += len;
                slen.clear();
                cigarData.push_back(make_pair(len, *c));
                break;
            case 'S':
                len = atoi(slen.c_str());
                slen.clear();
                cigarData.push_back(make_pair(len, *c));
                break;
            default:
                len = 0;
                slen += *c;
                break;
            }
        }

        string gapped_ref = string(reference).substr(referencePos, alignmentLength);
        string gapped_query = string(query);

        int refpos = 0;
        int readpos = 0;
        for (vector<pair<int, char> >::iterator c = cigarData.begin(); c != cigarData.end(); ++c) {
            int len = c->first;
            switch (c->second) {
            case 'I':
                gapped_ref.insert(refpos, string(len, '-'));
                readpos += len;
                refpos += len;
                break;
            case 'D':
                gapped_query.insert(readpos, string(len, '-'));
                refpos += len;
                readpos += len;
                break;
            case 'M':
                readpos += len;
                refpos += len;
                break;
            case 'S':
                readpos += len;
                gapped_ref.insert(refpos, string(len, '*'));
                refpos += len;
                break;
            default:
                break;
            }
        }

        cout << gapped_ref << endl << gapped_query << endl;
    }

	return 0;

}