-
Notifications
You must be signed in to change notification settings - Fork 6
/
bam2wig.c
336 lines (316 loc) · 10.5 KB
/
bam2wig.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
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
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
// gcc -g -O3 -Wall bam2depth.c -o bam2depth -I./samtools-0.1.19 -I./zlib-1.2.8/include -L./samtools-0.1.19 -L./zlib-1.2.8/lib -I. -L. -lhashtbl -lpthread -lm -lz -lbam
#include <stdio.h>
#include <getopt.h>
#include <math.h>
#include <err.h>
#include <time.h>
#include <sys/time.h>
#include <libgen.h>
#include "sam.h"
#include "hashtbl.h"
#include "IO_stream.h"
#define HASH_SIZE 5000000
typedef struct _data_buf_ {
samfile_t *fp;
HASHTBL *Start;
HASHTBL *End;
}DataBuf;
struct globalArgs_t {
char **infiles;
unsigned short numInfiles;
const char *outfile;
uint32_t window;
const char *region;
int strand;
} globalArgs;
static inline long long usec(void);
void output_bins(DataBuf *databuf,int ref,double *bins,int windows,FILE *stream);
void hash2BedGraph(DataBuf *databuf,int ref,double *bins,int windows);
static inline void hash_data_delete(void *DATA);
static inline int chr2int(const char *str);
static inline void overlap(int *j,int ref,int *subject_count,DataBuf *databuf,int windows,double *bins,uint32_t last_start,uint32_t last_end,double last_depth);
void bam_fetch_chr(bam_index_t *idx,const char *region,DataBuf *databuf);
bam_index_t *load_bam_index(char *filename);
static inline int fetch_func(const bam1_t *b, void *data);
static inline int insertInt2Hash(HASHTBL *Start,int pos,char *value);
void display_usage(char * argv[]);
long long usec(void) {
struct timeval tv;
gettimeofday(&tv,NULL);
return (((long long)tv.tv_sec)*1000000)+tv.tv_usec;
}
void display_usage(char * argv[]){
char *buffer=(char* )malloc(8092*sizeof(char));
const char* usage=
"\nCopyright (c) 2015\n" \
"Contact: XiongXu <[email protected]> <[email protected]> \n" \
"Usage: %s [-o OUTFILE] [-w WINDOW_SIZE] [-g gff_file] [-r chr1:1-2000000] [-s 0] [-h] bamFile1 bamFile2 ..\n" \
"Discription:\n This program is used for converting bam files to bedgraph format files,meanwhile calculate each window's base count and mean depth.\n" \
"Example1:\n %s -o out -w 20000 /share/work1/staff/xuxiong/lvliyaELL_L1_I008_tophat_mis2/accepted_hits.bam > depth \n" \
"Example2:\n %s -o out -w 20000 /share/work1/staff/xuxiong/twins/batch2/test_20131224/RT144FD_L1_I001.R1.clean.fastq.gz_1224/accepted_hits.bam > depth\n"\
"\n" \
" [-o OUTPUT_FILE] = OUTPUT file. [required]\n" \
" [-w WINDOW_SIZE] = window size. default is 20000. [option]\n" \
" [-r] = region, default is whole genome.(chr1:1-20000) [option]\n" \
" [-s] = bool variant,strand or not, default is 0. [option]\n" \
" [-h] = This helpful help screen. [option]\n" \
" Infiles = bam format input file(s),at least 1 bam file. [required]\n" \
"\n";
sprintf(buffer,usage,argv[0],argv[0],argv[0]);
fprintf(stderr,"%s",buffer);
exit(1);
}
int insertInt2Hash(HASHTBL *Start,int pos,char *value) {
int2char(pos,(UBYTE *)value);
void *val_data=hashtbl_get(Start,value);
if (val_data==NULL) {
int *init=(int *)malloc(sizeof(int));
*init=1;
hashtbl_insert(Start, value, (void *)init);
}
else{
(*(int *)val_data)++;
}
return 0;
}
int fetch_func(const bam1_t *b, void *data) {
DataBuf *databuf=(DataBuf *)data;
uint32_t *cigar = bam1_cigar(b);
const bam1_core_t *c = &b->core;
if (c->flag&BAM_FUNMAP) return 0;
if (b->core.tid < 0) return 0;
int i, l;
char *buf=(char *)malloc(32*sizeof(char));
unsigned int temp_start= c->pos;
for (i = l = 0; i < c->n_cigar; ++i) {
int op = cigar[i]&0xf;
if (op == BAM_CINS) continue;
if ( op == BAM_CDEL || op == BAM_CREF_SKIP){
l = cigar[i]>>4;
temp_start+=l;
}
else if (op == BAM_CMATCH ) {
l = cigar[i]>>4;
insertInt2Hash(databuf->Start,temp_start,buf);
temp_start+=l;
insertInt2Hash(databuf->End,temp_start,buf);
}
}
free(buf);
return 0;
}
bam_index_t *load_bam_index(char *filename){
bam_index_t *idx;
if ((idx = bam_index_load(filename)) == 0) {
fprintf(stderr, "bam2bed: BAM indexing file is not available.\n");
exit(1);
}
return idx;
}
void bam_fetch_chr(bam_index_t *idx,const char *region,DataBuf *databuf){
int ref, beg, end;
bam_parse_region(databuf->fp->header,region, &ref, &beg, &end);
if (ref < 0) {
fprintf(stderr, "bam2bed: Invalid region %s\n", globalArgs.region);
exit(1);
}
// fprintf(stdout,"%s\t%d\t%d\n",databuf->fp->header->target_name[ref],beg,end);
bam_fetch(databuf->fp->x.bam, idx, ref, beg, end, databuf, fetch_func);
}
void overlap(int *j,int ref,int *subject_count,DataBuf *databuf,int windows,double *bins,uint32_t last_start,uint32_t last_end,double last_depth){
if (*subject_count>1) {//deal whith the overlapping query
if((*j-*subject_count)>=0){
(*j)-=*subject_count ;
}else{
*j=0;
}
}
uint32_t window_start,window_end;
*subject_count=0;
while (*j<=windows){
window_start=globalArgs.window*(*j);
window_end= (*j+1)*globalArgs.window-1;
if (window_end>databuf->fp->header->target_len[ref]){
window_end=databuf->fp->header->target_len[ref];
}
if (last_end<window_start) {
break;
}else{
if (last_start<window_start) {
if (last_end<window_end) {
bins[*j]+=(last_end-window_start)*last_depth;
(*subject_count)++;
break;
}else{
bins[(*j)++]+=(window_end-window_start+1)*last_depth;
(*subject_count)++;
}
}else{
if (last_start<=window_end) {
if (last_end<=window_end) {
bins[*j]+=(last_end-last_start)*last_depth;
(*subject_count)++;
break;
}else{
bins[(*j)++]+=(window_end-last_start)*last_depth;
(*subject_count)++;
}
}else{
(*j)++;
}
}
}
}
}
int chr2int(const char *str){
int temp = 0;
const char *ptr = str;
if (*str == '-' || *str == '+') str++;
while(*str){
if (*str == 'X') {
return 23;
}else if (*str == 'Y') {
return 24;
}else if (*str == 'M') {
return 25;
}
if ((*str < '0') || (*str > '9')) {str++;continue;}
temp = temp * 10 + (*str++ - '0');
}
if (*ptr == '-') temp = -temp;
return temp;
}
void hash_data_delete(void *DATA) {
ENTRY *node=(ENTRY *)DATA;
free(node->data);
free(node);
}
void hash2BedGraph(DataBuf *databuf,int ref,double *bins,int windows){
int all_keys_count=databuf->Start->count+databuf->End->count;
if (!all_keys_count) return;
int i=0,j=0,prevkey=0,last_start=0,last_end=0,last_depth=0,Count=0,subject_count=0,pos=0;
char **all_keys=union_hashed_keys(databuf->Start,databuf->End);
for (i = 0; i < all_keys_count; ++i) {
char2int((UBYTE *)all_keys[i],&pos);
if (pos && pos==prevkey) continue;
if (prevkey) {
if (last_depth==Count) {
prevkey=last_start;
}
else{
if (last_depth){
overlap(&j,ref,&subject_count,databuf,windows,bins,last_start,last_end,(double)last_depth);
}
}
}
last_start=prevkey;
last_end=pos;
last_depth=Count;
void *data=hashtbl_get(databuf->Start,all_keys[i]);
if (data!=NULL) Count+= *(int*)data;
data=hashtbl_get(databuf->End,all_keys[i]);
if (data!=NULL) Count-= *(int*)data;
prevkey=pos;
}
if (last_depth){
overlap(&j,ref,&subject_count,databuf,windows,bins,last_start,last_end,(double)last_depth);
}
free(all_keys);
}
void output_bins(DataBuf *databuf,int ref,double *bins,int windows,FILE *stream){
int i;
for (i=0;i<windows ;i++ ){
int window_start = globalArgs.window*i;
int window_end = globalArgs.window*(i+1)-1 >databuf->fp->header->target_len[ref] ? databuf->fp->header->target_len[ref] : globalArgs.window*(i+1)-1;
fprintf(stream,"%s\t%d\t%d\t%.2f\n",
databuf->fp->header->target_name[ref],window_start,window_end,bins[i]/globalArgs.window);
}
}
void output_bins_wig(DataBuf *databuf,int ref,double *bins,int windows,FILE *stream){
int i;
fprintf(stream,"variableStep chrom=%s span=%d\n",databuf->fp->header->target_name[ref],globalArgs.window);
for (i=0;i<windows ;i++ ){
int window_start = globalArgs.window*i;
if (bins[i]) fprintf(stream,"%d\t%.2f\n",window_start,bins[i]/globalArgs.window);
}
}
int main(int argc, char *argv[])
{
int opt = 0;
globalArgs.infiles=NULL;
globalArgs.numInfiles=0;
globalArgs.outfile="-";
globalArgs.window=20000;
globalArgs.region="-";
globalArgs.strand=0;
const char *optString = "o:w:r:s:h?";
if (argc<2) display_usage(argv);
opt = getopt( argc, argv, optString );
while( opt != -1 ) {
switch( opt ) {
case 'o':
globalArgs.outfile = optarg;
break;
case 'w':
globalArgs.window = atoi(optarg);
break;
case 'r':
globalArgs.region = optarg;
case 's':
globalArgs.strand = atoi(optarg);
break;
case '?': /* fall-through is intentional */
case 'h':
display_usage(argv);
break;
default:
fprintf(stderr,"error parameter!\n");
break;
}
opt = getopt( argc, argv, optString );
}
globalArgs.infiles = argv + optind;
globalArgs.numInfiles = argc - optind;
long long begin;
begin=usec();
DataBuf *databuf=(DataBuf *)calloc(globalArgs.numInfiles,sizeof(DataBuf));
uint32_t i=0;
int j=0;
char *suffix=(char *)calloc(64,sizeof(char));
for (i=0;i<globalArgs.numInfiles ;i++ ) {
if (((databuf+i)->fp = samopen(*(globalArgs.infiles+i), "rb", 0)) == 0) {
err(1, "bam2bed: Fail to open BAM file %s\n", *(globalArgs.infiles+i));
}
sprintf(suffix,".%u.wig",i+1);
FILE *wig=fcreat_outfile(globalArgs.outfile,suffix);
sprintf(suffix,".%u.chromSize.txt",i+1);
FILE *chrSize=fcreat_outfile(globalArgs.outfile,suffix);
bam_index_t *idx=load_bam_index(*(globalArgs.infiles+i));
double **Bins=(double **)calloc((databuf+i)->fp->header->n_targets,sizeof(double *));
int *Windows=(int *)calloc((databuf+i)->fp->header->n_targets,sizeof(int));
for (j=0;j<(databuf+i)->fp->header->n_targets ;j++ ) {
Windows[j]=(databuf+i)->fp->header->target_len[j]/globalArgs.window+1;
(databuf+i)->Start=hashtbl_create(HASH_SIZE, NULL);
(databuf+i)->End=hashtbl_create(HASH_SIZE, NULL);
bam_fetch_chr(idx,(databuf+i)->fp->header->target_name[j],databuf+i);
Bins[j]=(double *)calloc(Windows[j],sizeof(double));
hash2BedGraph(databuf+i,j,Bins[j],Windows[j]);
hashtbl_destroy((databuf+i)->Start,hash_data_delete);
hashtbl_destroy((databuf+i)->End,hash_data_delete);
output_bins_wig(databuf+i,j,Bins[j],Windows[j],wig);
free(Bins[j]);
fprintf(chrSize,"%s\t%d\n",(databuf+i)->fp->header->target_name[j],(databuf+i)->fp->header->target_len[j]);
fprintf(stderr,"%s at %.3f s\n",(databuf+i)->fp->header->target_name[j],(double)(usec()-begin)/CLOCKS_PER_SEC);
}
free(Windows);
free(Bins);
bam_index_destroy(idx);
samclose((databuf+i)->fp);
fclose(wig);
fclose(chrSize);
fprintf(stderr,"Converted %s to wig format at %.3f s\n",*(globalArgs.infiles+i),(double)(usec()-begin)/CLOCKS_PER_SEC);
}
free(suffix);
free(databuf);
return 0;
}