-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalign2seq.c
59 lines (51 loc) · 1.71 KB
/
align2seq.c
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
/**
>HEADER
Copyright (c) 2004 Haixu Tang [email protected]
This file is part of the RepGraph package.
RepGraph is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
RepGraph is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with RepGraph. If not, see <http://www.gnu.org/licenses/>.
<HEADER
**/
#include <stdinc.h>
#include <extvab.h>
#include <extfunc.h>
int align2seq(char *seq1, int len_seq1, char *seq2, int len_seq2, char **alnseq);
int align2seq(char *seq1, int len_seq1, char *seq2, int len_seq2, char **alnseq)
{
int i, j, k, l;
int *sapp;
int windows;
int gscore, ALIGN0();
sapp = (int *) ckalloc((len_seq1 + len_seq2 + 1) * sizeof(int));
alnseq[0] = (char *) ckalloc((len_seq1 + len_seq2 + 1) * sizeof(char));
alnseq[1] = (char *) ckalloc((len_seq1 + len_seq2 + 1) * sizeof(char));
windows = abs(len_seq1 - len_seq2) + 1000;
gscore = ALIGN0(&seq1[-1], &seq2[-1], len_seq1, len_seq2, -windows, windows, W, 16, 4, sapp, len_seq1 + len_seq2 + 1,
len_seq1 + len_seq2 + 1);
i = j = k = 0;
l = 0;
while(i < len_seq1 && j < len_seq2) {
if(sapp[k] == 0) {
alnseq[0][l] = seq1[i];
alnseq[1][l] = seq2[j];
i ++;
j ++;
l ++;
} else if(sapp[k] > 0) {
j += sapp[k];
} else {
i -= sapp[k];
}
k ++;
}
free((void *) sapp);
return(l);
}