aboutsummaryrefslogtreecommitdiff
path: root/kmer_counts_per_sequence.c
blob: 2b95ed12ba0e1c9bf3ae7388fa19c781ce6c0998 (plain)
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
// Copyright 2013 Calvin Morrison
#include <errno.h>
#include <getopt.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

#include "kmer_utils.h"

void help() {
	printf("usage: kmer_counts_per_sequence input_file kmer [kmer-file] ...\n\n"
				 "count mers in each sequence of size k from a fasta file\n"
				 "\n"
				 "  --input    -i  input fasta file to count\n"
				 "  --kmer     -k  size of mers to count\n"
				 "  --mer-file -m  a file containing a list of mers you are interested\n"
				 "                 in opening. this will enable output your results in\n"
				 "                 a sparse format \n"
				 "  --sparse   -s  output values in a sparse format. output is in the\n"
				 "                 order sequence_number, mer_index, value\n"
				 "\n"
				 "Report all bugs to mutantturkey@gmail.com\n"
				 "\n"
				 "Copyright 2014 Calvin Morrison, Drexel University.\n"
				 "\n"
				 "If you are using any dna-utils tool for a publication\n"
				 "please cite your usage:\n\n"
				 "dna-utils. Drexel University, Philadelphia USA, 2014;\n"
				 "software available at www.github.com/EESI/dna-utils/\n");
}


int main(int argc, char **argv) {


	// getdelim variables
	char *fn = NULL;
	FILE *fh = NULL;

	// for specific mers
	char *mer_fn = NULL;
	size_t num_desired_indicies = 0;
	size_t *desired_indicies = NULL;

	// for getdelim
	char *line = NULL;
	size_t len = 0;
	ssize_t read;

	// sizes
	unsigned int kmer = 0;
	size_t width = 0;

	bool sparse = false;
	bool kmer_set = false;
	bool specific_mers = false;

	static struct option long_options[] = {
		{"input", required_argument, 0, 'i'},
		{"kmer",  required_argument, 0, 'k'},
		{"sparse", no_argument, 0, 's'},
		{"mer-file", required_argument, 0, 'm'},
		{"help", no_argument, 0, 'h'},
		{0, 0, 0, 0}
	};

	while (1) {

		int option_index = 0;
		int c = 0;

		c = getopt_long (argc, argv, "i:k:m:vsh", long_options, &option_index);

		if (c == -1)
			break;

		switch (c) {
			case 'i':
				fn = optarg;
				break;
			case 'k':
				kmer = atoi(optarg);
				kmer_set = true;
				break;
			case 's':
				sparse = true;
				break;
			case 'm':
				mer_fn = optarg;
				specific_mers = true;
				break;
			case 'h':
				help();
				exit(EXIT_SUCCESS);
				break;
			case 'v':
				printf("dna-utils version " VERSION "\n");
				exit(EXIT_SUCCESS);
				break;
			default:
				break;
		}
	}
	if(argc == 1) {
		help();
		exit(EXIT_FAILURE);
	}
	if(fn == NULL) {
		fprintf(stderr, "no input file specified with -i, reading from stdin\n");
		fh = stdin;
	}
	else {
		fh = fopen(fn, "r");
		if(fh == NULL) {
			fprintf(stderr, "Could not open %s - %s\n", fn, strerror(errno));
			exit(EXIT_FAILURE);
		}
	}
	if(!kmer_set) {
		fprintf(stderr, "Error: kmer (-k) must be supplied\n");
		exit(EXIT_FAILURE);
	}
	if(kmer == 0) { 
		fprintf(stderr, "Error: invalid kmer - '%d'.\n", kmer);
		exit(EXIT_FAILURE);
	}

 	width = pow_four(kmer);

	if(specific_mers) {
		sparse = false;
		desired_indicies = malloc((width) * sizeof(size_t));
		if(desired_indicies == NULL) 
			exit(EXIT_FAILURE);
		num_desired_indicies = load_specific_mers_from_file(mer_fn, kmer, width, desired_indicies);
		if(num_desired_indicies == 0) {
			fprintf(stderr, "Error: no mers loaded from file"); 
			exit(EXIT_FAILURE);
		}
	}


	unsigned long long *counts = malloc((width+ 1) * sizeof(unsigned long long));
	if(counts == NULL) 
		exit(EXIT_FAILURE);

	unsigned long long sequence = 0;
	while ((read = getdelim(&line, &len, '>', fh)) != -1) {
		long long i = 0;
		size_t k = 0;

		memset(counts, 0, width * sizeof(unsigned long long));

		// find our first \n, this should be the end of the header
		char *seq = strchr(line, '\n');	
		if(seq == NULL) 
			continue;


		// point to one past that.
		seq = seq + 1;

		// strip out all other newlines to handle multiline sequences
		size_t seq_length = strnstrip(seq, '\n', strlen(seq));

		// reset our count matrix to zero

		for(k = 0; k < seq_length; k++) {
			seq[k] = alpha[(int)seq[k]];
		}

		for(i = 0; i < (signed long long)(seq_length - kmer + 1); i++) {
			size_t mer = num_to_index(&seq[i],kmer, width, &i);
			counts[mer]++;
		}
		

		if(specific_mers) {
			for(k = 0; k < num_desired_indicies; k++) {
				if(desired_indicies[k] != 0)
					fprintf(stdout, "%llu\t%zu\t%llu\n", sequence, desired_indicies[k], counts[desired_indicies[k]]);
			}
		} 
		else if(sparse) {
			for(k = 0; k < width; k++) {
				if(counts[k] != 0)
					fprintf(stdout, "%llu\t%zu\t%llu\n", sequence, k, counts[k]);
			}
		}
		else {
			for(k = 0; k < width - 1; k++)
				fprintf(stdout, "%llu\t", counts[k]);
			fprintf(stdout, "%llu\n", counts[width - 1]);
		}

		sequence++;
	}

free(counts);
free(line);
free(desired_indicies);
fclose(fh);


return EXIT_SUCCESS;
}