-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreadseq1by1.c
118 lines (101 loc) · 2.8 KB
/
readseq1by1.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
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
/**
>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 <extfunc.h>
#define MAXNUM 250000000
int readseq1by1(char **src_seq, char **src_name, int *len_seq, FILE *fp);
int readseq1by1gen(char **src_seq, char **src_name, int *len_seq, FILE *fp);
int readseq1by1(char **src_seq, char **src_name, int *len_seq, FILE *fp)
{
int i, j, k, n;
char *seq, c;
char str[500];
seq = (char *) ckalloc(MAXNUM * sizeof(char));
n = 0;
k = -1;
while(fgets(str, 450, fp)) {
if(str[0] == '#') continue;
if(str[0] == '>') {
if(k >= 0) {
len_seq[k] = n;
src_seq[k] = (char *) ckalloc((n + 1) * sizeof(char));
for(i = 0; i < n; i ++) src_seq[k][i] = seq[i];
}
n = 0;
k ++;
sscanf(&str[1], "%s", src_name[k]);
} else {
for(i = 0; i < strlen(str); i ++) {
if(str[i] >= 'a' && str[i] <= 'z') {
c = char2int(str[i]);
seq[n ++] = c;
} else if(str[i] >= 'A' && str[i] <= 'Z') {
c = char2int(str[i] - 'A' + 'a');
seq[n ++] = c;
}
}
}
}
if(k >= 0) {
len_seq[k] = n;
src_seq[k] = (char *) ckalloc((n + 1) * sizeof(char));
for(i = 0; i < n; i ++) src_seq[k][i] = seq[i];
}
k ++;
free((void *) seq);
return(k);
}
int readseq1by1gen(char **src_seq, char **src_name, int *len_seq, FILE *fp)
{
int i, j, k, n;
char *seq, c;
char str[500];
seq = (char *) ckalloc(MAXNUM * sizeof(char));
n = 0;
k = -1;
while(fgets(str, 450, fp)) {
if(str[0] == '#') continue;
if(str[0] == '>') {
if(k >= 0) {
len_seq[k] = n;
src_seq[k] = (char *) ckalloc((n + 1) * sizeof(char));
for(i = 0; i < n; i ++) src_seq[k][i] = seq[i];
}
n = 0;
k ++;
sscanf(&str[1], "%s", src_name[k]);
} else {
for(i = 0; i < strlen(str); i ++) {
if(str[i] >= 'a' && str[i] <= 'z') {
c = char2intgen(str[i]);
seq[n ++] = c;
} else if(str[i] >= 'A' && str[i] <= 'Z') {
c = char2intgen(str[i] - 'A' + 'a');
seq[n ++] = c;
}
}
}
}
if(k >= 0) {
len_seq[k] = n;
src_seq[k] = (char *) ckalloc((n + 1) * sizeof(char));
for(i = 0; i < n; i ++) src_seq[k][i] = seq[i];
}
k ++;
free((void *) seq);
return(k);
}