annotate bwa-0.6.2/bwtgap.c @ 2:a294fbfcb1db draft default tip

Uploaded BWA
author ashvark
date Fri, 18 Jul 2014 07:55:59 -0400
parents dd1186b11b3b
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
0
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
1 #include <stdio.h>
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
2 #include <stdlib.h>
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
3 #include <string.h>
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
4 #include "bwtgap.h"
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
5 #include "bwtaln.h"
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
6
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
7 #define STATE_M 0
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
8 #define STATE_I 1
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
9 #define STATE_D 2
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
10
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
11 #define aln_score(m,o,e,p) ((m)*(p)->s_mm + (o)*(p)->s_gapo + (e)*(p)->s_gape)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
12
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
13 gap_stack_t *gap_init_stack2(int max_score)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
14 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
15 gap_stack_t *stack;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
16 stack = (gap_stack_t*)calloc(1, sizeof(gap_stack_t));
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
17 stack->n_stacks = max_score;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
18 stack->stacks = (gap_stack1_t*)calloc(stack->n_stacks, sizeof(gap_stack1_t));
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
19 return stack;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
20 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
21
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
22 gap_stack_t *gap_init_stack(int max_mm, int max_gapo, int max_gape, const gap_opt_t *opt)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
23 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
24 return gap_init_stack2(aln_score(max_mm+1, max_gapo+1, max_gape+1, opt));
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
25 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
26
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
27 void gap_destroy_stack(gap_stack_t *stack)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
28 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
29 int i;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
30 for (i = 0; i != stack->n_stacks; ++i) free(stack->stacks[i].stack);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
31 free(stack->stacks);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
32 free(stack);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
33 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
34
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
35 static void gap_reset_stack(gap_stack_t *stack)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
36 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
37 int i;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
38 for (i = 0; i != stack->n_stacks; ++i)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
39 stack->stacks[i].n_entries = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
40 stack->best = stack->n_stacks;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
41 stack->n_entries = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
42 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
43
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
44 static inline void gap_push(gap_stack_t *stack, int i, bwtint_t k, bwtint_t l, int n_mm, int n_gapo, int n_gape,
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
45 int state, int is_diff, const gap_opt_t *opt)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
46 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
47 int score;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
48 gap_entry_t *p;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
49 gap_stack1_t *q;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
50 score = aln_score(n_mm, n_gapo, n_gape, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
51 q = stack->stacks + score;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
52 if (q->n_entries == q->m_entries) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
53 q->m_entries = q->m_entries? q->m_entries<<1 : 4;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
54 q->stack = (gap_entry_t*)realloc(q->stack, sizeof(gap_entry_t) * q->m_entries);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
55 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
56 p = q->stack + q->n_entries;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
57 p->info = (u_int32_t)score<<21 | i; p->k = k; p->l = l;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
58 p->n_mm = n_mm; p->n_gapo = n_gapo; p->n_gape = n_gape; p->state = state;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
59 p->last_diff_pos = is_diff? i : 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
60 ++(q->n_entries);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
61 ++(stack->n_entries);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
62 if (stack->best > score) stack->best = score;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
63 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
64
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
65 static inline void gap_pop(gap_stack_t *stack, gap_entry_t *e)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
66 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
67 gap_stack1_t *q;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
68 q = stack->stacks + stack->best;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
69 *e = q->stack[q->n_entries - 1];
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
70 --(q->n_entries);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
71 --(stack->n_entries);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
72 if (q->n_entries == 0 && stack->n_entries) { // reset best
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
73 int i;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
74 for (i = stack->best + 1; i < stack->n_stacks; ++i)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
75 if (stack->stacks[i].n_entries != 0) break;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
76 stack->best = i;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
77 } else if (stack->n_entries == 0) stack->best = stack->n_stacks;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
78 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
79
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
80 static inline void gap_shadow(int x, int len, bwtint_t max, int last_diff_pos, bwt_width_t *w)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
81 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
82 int i, j;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
83 for (i = j = 0; i < last_diff_pos; ++i) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
84 if (w[i].w > x) w[i].w -= x;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
85 else if (w[i].w == x) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
86 w[i].bid = 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
87 w[i].w = max - (++j);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
88 } // else should not happen
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
89 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
90 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
91
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
92 static inline int int_log2(uint32_t v)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
93 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
94 int c = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
95 if (v & 0xffff0000u) { v >>= 16; c |= 16; }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
96 if (v & 0xff00) { v >>= 8; c |= 8; }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
97 if (v & 0xf0) { v >>= 4; c |= 4; }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
98 if (v & 0xc) { v >>= 2; c |= 2; }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
99 if (v & 0x2) c |= 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
100 return c;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
101 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
102
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
103 bwt_aln1_t *bwt_match_gap(bwt_t *const bwt, int len, const ubyte_t *seq, bwt_width_t *width,
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
104 bwt_width_t *seed_width, const gap_opt_t *opt, int *_n_aln, gap_stack_t *stack)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
105 {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
106 int best_score = aln_score(opt->max_diff+1, opt->max_gapo+1, opt->max_gape+1, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
107 int best_diff = opt->max_diff + 1, max_diff = opt->max_diff;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
108 int best_cnt = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
109 int max_entries = 0, j, _j, n_aln, m_aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
110 bwt_aln1_t *aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
111
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
112 m_aln = 4; n_aln = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
113 aln = (bwt_aln1_t*)calloc(m_aln, sizeof(bwt_aln1_t));
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
114
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
115 // check whether there are too many N
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
116 for (j = _j = 0; j < len; ++j)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
117 if (seq[j] > 3) ++_j;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
118 if (_j > max_diff) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
119 *_n_aln = n_aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
120 return aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
121 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
122
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
123 //for (j = 0; j != len; ++j) printf("#0 %d: [%d,%u]\t[%d,%u]\n", j, w[0][j].bid, w[0][j].w, w[1][j].bid, w[1][j].w);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
124 gap_reset_stack(stack); // reset stack
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
125 gap_push(stack, len, 0, bwt->seq_len, 0, 0, 0, 0, 0, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
126
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
127 while (stack->n_entries) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
128 gap_entry_t e;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
129 int i, m, m_seed = 0, hit_found, allow_diff, allow_M, tmp;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
130 bwtint_t k, l, cnt_k[4], cnt_l[4], occ;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
131
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
132 if (max_entries < stack->n_entries) max_entries = stack->n_entries;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
133 if (stack->n_entries > opt->max_entries) break;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
134 gap_pop(stack, &e); // get the best entry
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
135 k = e.k; l = e.l; // SA interval
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
136 i = e.info&0xffff; // length
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
137 if (!(opt->mode & BWA_MODE_NONSTOP) && e.info>>21 > best_score + opt->s_mm) break; // no need to proceed
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
138
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
139 m = max_diff - (e.n_mm + e.n_gapo);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
140 if (opt->mode & BWA_MODE_GAPE) m -= e.n_gape;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
141 if (m < 0) continue;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
142 if (seed_width) { // apply seeding
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
143 m_seed = opt->max_seed_diff - (e.n_mm + e.n_gapo);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
144 if (opt->mode & BWA_MODE_GAPE) m_seed -= e.n_gape;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
145 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
146 //printf("#1\t[%d,%d,%d,%c]\t[%d,%d,%d]\t[%u,%u]\t[%u,%u]\t%d\n", stack->n_entries, a, i, "MID"[e.state], e.n_mm, e.n_gapo, e.n_gape, width[i-1].bid, width[i-1].w, k, l, e.last_diff_pos);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
147 if (i > 0 && m < width[i-1].bid) continue;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
148
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
149 // check whether a hit is found
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
150 hit_found = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
151 if (i == 0) hit_found = 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
152 else if (m == 0 && (e.state == STATE_M || (opt->mode&BWA_MODE_GAPE) || e.n_gape == opt->max_gape)) { // no diff allowed
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
153 if (bwt_match_exact_alt(bwt, i, seq, &k, &l)) hit_found = 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
154 else continue; // no hit, skip
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
155 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
156
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
157 if (hit_found) { // action for found hits
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
158 int score = aln_score(e.n_mm, e.n_gapo, e.n_gape, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
159 int do_add = 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
160 //printf("#2 hits found: %d:(%u,%u)\n", e.n_mm+e.n_gapo, k, l);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
161 if (n_aln == 0) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
162 best_score = score;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
163 best_diff = e.n_mm + e.n_gapo;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
164 if (opt->mode & BWA_MODE_GAPE) best_diff += e.n_gape;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
165 if (!(opt->mode & BWA_MODE_NONSTOP))
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
166 max_diff = (best_diff + 1 > opt->max_diff)? opt->max_diff : best_diff + 1; // top2 behaviour
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
167 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
168 if (score == best_score) best_cnt += l - k + 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
169 else if (best_cnt > opt->max_top2) break; // top2b behaviour
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
170 if (e.n_gapo) { // check whether the hit has been found. this may happen when a gap occurs in a tandem repeat
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
171 for (j = 0; j != n_aln; ++j)
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
172 if (aln[j].k == k && aln[j].l == l) break;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
173 if (j < n_aln) do_add = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
174 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
175 if (do_add) { // append
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
176 bwt_aln1_t *p;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
177 gap_shadow(l - k + 1, len, bwt->seq_len, e.last_diff_pos, width);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
178 if (n_aln == m_aln) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
179 m_aln <<= 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
180 aln = (bwt_aln1_t*)realloc(aln, m_aln * sizeof(bwt_aln1_t));
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
181 memset(aln + m_aln/2, 0, m_aln/2*sizeof(bwt_aln1_t));
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
182 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
183 p = aln + n_aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
184 p->n_mm = e.n_mm; p->n_gapo = e.n_gapo; p->n_gape = e.n_gape;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
185 p->k = k; p->l = l;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
186 p->score = score;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
187 ++n_aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
188 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
189 continue;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
190 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
191
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
192 --i;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
193 bwt_2occ4(bwt, k - 1, l, cnt_k, cnt_l); // retrieve Occ values
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
194 occ = l - k + 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
195 // test whether diff is allowed
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
196 allow_diff = allow_M = 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
197 if (i > 0) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
198 int ii = i - (len - opt->seed_len);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
199 if (width[i-1].bid > m-1) allow_diff = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
200 else if (width[i-1].bid == m-1 && width[i].bid == m-1 && width[i-1].w == width[i].w) allow_M = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
201 if (seed_width && ii > 0) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
202 if (seed_width[ii-1].bid > m_seed-1) allow_diff = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
203 else if (seed_width[ii-1].bid == m_seed-1 && seed_width[ii].bid == m_seed-1
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
204 && seed_width[ii-1].w == seed_width[ii].w) allow_M = 0;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
205 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
206 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
207 // indels
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
208 tmp = (opt->mode & BWA_MODE_LOGGAP)? int_log2(e.n_gape + e.n_gapo)/2+1 : e.n_gapo + e.n_gape;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
209 if (allow_diff && i >= opt->indel_end_skip + tmp && len - i >= opt->indel_end_skip + tmp) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
210 if (e.state == STATE_M) { // gap open
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
211 if (e.n_gapo < opt->max_gapo) { // gap open is allowed
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
212 // insertion
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
213 gap_push(stack, i, k, l, e.n_mm, e.n_gapo + 1, e.n_gape, STATE_I, 1, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
214 // deletion
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
215 for (j = 0; j != 4; ++j) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
216 k = bwt->L2[j] + cnt_k[j] + 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
217 l = bwt->L2[j] + cnt_l[j];
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
218 if (k <= l) gap_push(stack, i + 1, k, l, e.n_mm, e.n_gapo + 1, e.n_gape, STATE_D, 1, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
219 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
220 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
221 } else if (e.state == STATE_I) { // extention of an insertion
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
222 if (e.n_gape < opt->max_gape) // gap extention is allowed
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
223 gap_push(stack, i, k, l, e.n_mm, e.n_gapo, e.n_gape + 1, STATE_I, 1, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
224 } else if (e.state == STATE_D) { // extention of a deletion
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
225 if (e.n_gape < opt->max_gape) { // gap extention is allowed
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
226 if (e.n_gape + e.n_gapo < max_diff || occ < opt->max_del_occ) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
227 for (j = 0; j != 4; ++j) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
228 k = bwt->L2[j] + cnt_k[j] + 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
229 l = bwt->L2[j] + cnt_l[j];
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
230 if (k <= l) gap_push(stack, i + 1, k, l, e.n_mm, e.n_gapo, e.n_gape + 1, STATE_D, 1, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
231 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
232 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
233 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
234 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
235 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
236 // mismatches
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
237 if (allow_diff && allow_M) { // mismatch is allowed
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
238 for (j = 1; j <= 4; ++j) {
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
239 int c = (seq[i] + j) & 3;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
240 int is_mm = (j != 4 || seq[i] > 3);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
241 k = bwt->L2[c] + cnt_k[c] + 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
242 l = bwt->L2[c] + cnt_l[c];
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
243 if (k <= l) gap_push(stack, i, k, l, e.n_mm + is_mm, e.n_gapo, e.n_gape, STATE_M, is_mm, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
244 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
245 } else if (seq[i] < 4) { // try exact match only
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
246 int c = seq[i] & 3;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
247 k = bwt->L2[c] + cnt_k[c] + 1;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
248 l = bwt->L2[c] + cnt_l[c];
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
249 if (k <= l) gap_push(stack, i, k, l, e.n_mm, e.n_gapo, e.n_gape, STATE_M, 0, opt);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
250 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
251 }
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
252
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
253 *_n_aln = n_aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
254 //fprintf(stderr, "max_entries = %d\n", max_entries);
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
255 return aln;
dd1186b11b3b Uploaded BWA
ashvark
parents:
diff changeset
256 }