File: CAlign.xs

package info (click to toggle)
gbrowse 2.56%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 13,112 kB
  • ctags: 4,436
  • sloc: perl: 50,765; sh: 249; sql: 62; makefile: 45; ansic: 27
file content (233 lines) | stat: -rw-r--r-- 6,099 bytes parent folder | download | duplicates (7)
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
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"

#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#include "realign.h"

#define DBG 0

static ACellPtr new_row (int len) {
  return (ACellPtr) calloc(len,sizeof(ACell));
}

static void initMatrix(MatchMatrix* matrix) {
  matrix->match      = 1;
  matrix->mismatch   = -1;
  matrix->gap        = -1;
  matrix->gap_extend = 0;
  matrix->wcmatch    = 0;
  matrix->wildcard   = 'N';
}

/* note if matrix is NULL then use a standard matrix */
int realign (const char* src, const char* tgt, 
	     const MatchMatrixPtr matrix,
	     AlignmentPtr *align_out) {
  int                 src_len,tgt_len;
  int                 row,col,score;
  char                src_chr,tgt_chr;
  int                 extend_score,gap_src_score,gap_tgt_score,i;
  MatchMatrix         defmat,*mat;
  ACellPtr            *dpm;
  AlignmentPtr        alignment;
  bestcelldata        best_cell;  

  /* initialize matrix */
  if (matrix == NULL) {
    initMatrix(&defmat);
    mat = &defmat;
  } else {
    mat = matrix;
  }

  src_len = strlen(src);
  tgt_len = strlen(tgt);

  dpm    = (ACellPtr*) calloc(src_len+1,sizeof(ACellPtr));
  dpm[0] = new_row(tgt_len+1);

  best_cell.row   = 0;
  best_cell.col   = 0;
  best_cell.score = -999999;

#if DBG
  fprintf(stderr,"%-4c %-4c",' ',' ');
  for (i=0;i<tgt_len;i++)
    fprintf(stderr," %4c",tgt[i]);
  fprintf(stderr,"\n");
  fprintf(stderr,"%-4c ",' ');
  for (i=0; i<=tgt_len; i++) {
    fprintf(stderr,"%4d ",dpm[0][i]);
  }
  fprintf(stderr,"\n");
#endif

  for (row=0; row<src_len; row++) {

    src_chr  = toupper(src[row]);

#if DBG
    fprintf(stderr,"%-4c ",src_chr);
#endif

    /* current position is [row+1][col+1] */
    dpm[row+1] = new_row(tgt_len+1);

    for (col=0; col<tgt_len; col++) {

      tgt_chr = toupper(tgt[col]);

      extend_score =  dpm[row][col].score +
	(
	 (tgt_chr == mat->wildcard  || src_chr == mat->wildcard)  ? mat->wcmatch
	 : (tgt_chr == src_chr) ? mat->match
	                        : mat->mismatch
	 );

      /* what happens if we extend the src one character, gapping tgt? */
      gap_tgt_score = dpm[row+1][col].score + 
	((dpm[row+1][col].event > A_EXTEND) ? mat->gap_extend : mat->gap);

      /* what happens if we extend the tgt strand one character, gapping src? */
      gap_src_score = dpm[row][col+1].score + 
	((dpm[row][col+1].event > A_EXTEND) ? mat->gap_extend : mat->gap);

      /* find best score among the possibilities */
      if (extend_score >= gap_src_score && extend_score >= gap_tgt_score) {
	score = dpm[row+1][col+1].score = extend_score;
	dpm[row+1][col+1].event = A_EXTEND;
      } else if (gap_src_score >= gap_tgt_score) {
	score = dpm[row+1][col+1].score = gap_src_score;
	dpm[row+1][col+1].event = GAP_SRC;
      } else {
	score = dpm[row+1][col+1].score = gap_tgt_score;
	dpm[row+1][col+1].event = GAP_TGT;
      }
     
      /* save it for posterity */
      if (score >= best_cell.score) {
	best_cell.score = score;
	best_cell.row   = row+1;
	best_cell.col   = col+1;
      }
    }
#if DBG
    for (i=0; i<=tgt_len; i++) {
      fprintf(stderr,"%4d ",dpm[row+1][i]);
    }
    fprintf(stderr,"\n");
#endif
  }

  /* now do the trace back */
#if DBG
  fprintf(stderr,"starting traceback\n");
#endif
  row = best_cell.row;
  col = best_cell.col;
  alignment = (AlignmentPtr) calloc(src_len,sizeof(int));

  for (i=0;i<src_len;i++)
    alignment[i] = -1;

  while (row > 0 && col > 0) {
#if DBG
    fprintf(stderr,"row=%d, col=%d, score=%d, event=%s\n",row,col,dpm[row][col].score,
	    dpm[row][col].event==A_EXTEND ? "extend"
           :dpm[row][col].event==GAP_TGT  ? "gap_tgt"
           :dpm[row][col].event==GAP_SRC  ? "gap_src"
	   :"error");
#endif

    alignment[row-1] = col-1;
    if (dpm[row][col].event == A_EXTEND) {
      row--; col--;
    }

    else if (dpm[row][col].event == GAP_TGT) {
      col--;
    }

    else {
      alignment[row-1] = -1;  /* -1 means no match */
      row--;
    }
  }

#if DBG
  fprintf(stderr,"traceback done\n");
#endif

  *align_out = alignment;

#if DBG
  for (i=0;i<src_len;i++) {
    fprintf(stderr,"%3d %1c %3d %1c\n",
	    i,src[i],alignment[i],alignment[i]>=0 ? tgt[alignment[i]] : '-');
  }
#endif


  /* clean up */
  for (row=0; row<=src_len; row++) {
    free(dpm[row]);
  }
  free(dpm);
  return best_cell.score;
}

MODULE = Bio::Graphics::Browser::CAlign		PACKAGE = Bio::Graphics::Browser::CAlign

void
_do_alignment(packname="Bio::Graphics::Browser::CAlign",src,tgt,options=NULL)
     char*         packname
     char*         src
     char*         tgt
     SV*           options
     PROTOTYPE: $$;$
     PREINIT:
     MatchMatrix   matrix;
     HV*           optionh;
     SV            **value;
     int           score,i;
     AlignmentPtr  alignment;
     AV*           palign;
     PPCODE:
     {
       /* copy defaults from standardMatrix */
       initMatrix(&matrix);

       if (options != NULL) {
	 if (!SvROK(options) || (SvTYPE(SvRV(options)) != SVt_PVHV))
	   croak("_do_alignment(): third argument must be a hashref");
	 optionh = (HV*) SvRV(options);
	 if (value = hv_fetch(optionh,"match",strlen("match"),0))
	   matrix.match = SvIV(*value);
	 if (value = hv_fetch(optionh,"mismatch",strlen("mismatch"),0))
	   matrix.mismatch = SvIV(*value);
	 if (value = hv_fetch(optionh,"gap",strlen("gap"),0))
	   matrix.gap = SvIV(*value);
	 if (value = hv_fetch(optionh,"gap_extend",strlen("gap_extend"),0))
	   matrix.gap_extend = SvIV(*value);
	 if (value = hv_fetch(optionh,"wildcard_match",strlen("wildcard_match"),0))
	   matrix.wcmatch = SvIV(*value);
	 if (value = hv_fetch(optionh,"wildcard",strlen("wildcard"),0))
	   matrix.wildcard   = *SvPV_nolen(*value);
       }

       score = realign(src,tgt,&matrix,&alignment);

       palign = (AV*)sv_2mortal((SV*) newAV());
       av_extend(palign,strlen(src));
       for (i=0;i<strlen(src);i++)
	 if (alignment[i] >= 0)
	   av_push(palign,newSVnv(alignment[i]));
	 else
	   av_push(palign,&PL_sv_undef);

       XPUSHs(sv_2mortal(newSViv(score)));
       XPUSHs(sv_2mortal(newRV((SV*) palign)));
     }