1 /* Martin Asser Hansen (mail@maasha.dk) Copyright (C) 2008 - All right reserved */
10 #define add_A( c ) /* add 00 to the rightmost two bits of bin (i.e. do nothing). */
11 #define add_T( c ) ( c |= 3 ) /* add 11 on the rightmost two bits of c. */
12 #define add_C( c ) ( c |= 1 ) /* add 01 on the rightmost two bits of c. */
13 #define add_G( c ) ( c |= 2 ) /* add 10 on the rightmost two bits of c. */
15 static uint mask_create( int oligo_size );
16 static void oligo_count( char *path, uint **array_ppt, uint nmer, uint mask );
17 static void oligo_count_output( char *path, uint *array, uint nmer, uint mask, bool log10_flag );
18 static void fixedstep_put_entry( char *chr, int beg, int step_size, uint *block_array, int block_size, bool log10_flag );
25 "repeat-O-matic determines the repetiveness of a genome by determining\n"
26 "the number of identical n-mers for each position in the genome.\n"
28 "The output is a fixedStep file ala the phastCons files from the UCSC\n"
31 "Usage: repeat-O-matic [options] <FASTA file>\n"
34 " [-n <int> | --nmer <int>] # nmer size between 1 and 15 (Default 15).\n"
35 " [-1 | --log10] # output log10 (Default no).\n"
38 " repeat-O-matic -n 14 -l hg18.fna > hg18.fixedStep\n"
40 "Copyright (C) 2008, Martin A. Hansen\n"
48 int main( int argc, char *argv[] )
52 bool log10_flag = FALSE;
57 static struct option longopts[] = {
58 { "nmer", required_argument, NULL, 'n' },
59 { "log10", no_argument, NULL, 'l' },
63 while ( ( opt = getopt_long( argc, argv, "n:l", longopts, NULL ) ) != -1 )
66 case 'n': nmer = strtol( optarg, NULL, 0 ); break;
67 case 'l': log10_flag = TRUE; break;
75 if ( nmer < 1 || nmer > 15 )
77 fprintf( stderr, "ERROR: nmer must be between 1 and 15 inclusive - not %d\n", nmer );
85 path = argv[ argc - 1 ];
87 mask = mask_create( nmer );
89 oligo_count( path, &array, nmer, mask );
91 oligo_count_output( path, array, nmer, mask, log10_flag );
97 uint mask_create( int oligo_size )
99 /* Martin A. Hansen, June 2008 */
101 /* Create a bit mask for binary encoded oligos less than 32 bits. */
106 for ( i = 0; i < oligo_size; i++ )
110 mask |= 3; /* add 11 to mask */
117 void oligo_count( char *path, uint **array_ppt, uint nmer, uint mask )
119 /* Martin A. Hansen, June 2008 */
121 /* Count the occurence of all oligos of a fixed size in a FASTA file. */
123 uint *array = *array_ppt;
128 seq_entry *entry = NULL;
131 array_size = ( 1 << ( nmer * 2 ) );
132 array = mem_get_zero( sizeof( uint ) * array_size );
134 fp = read_open( path );
136 entry = seq_new( MAX_SEQ_NAME, MAX_SEQ );
138 while ( ( fasta_get_entry( fp, &entry ) ) != 0 )
140 fprintf( stderr, "Counting oligos in: %s ... ", entry->seq_name );
142 /* ---- Sense strand ---- */
147 for ( i = 0; entry->seq[ i ]; i++ )
151 switch( entry->seq[ i ] )
153 case 'A': case 'a': add_A( bin ); j++; break;
154 case 'T': case 't': add_T( bin ); j++; break;
155 case 'C': case 'c': add_C( bin ); j++; break;
156 case 'G': case 'g': add_G( bin ); j++; break;
157 default: bin = 0; j = 0; break;
162 array[ ( bin & mask ) ]++;
165 printf( "mask : %s\n", bits2string( mask ) );
166 printf( "bin : %s\n", bits2string( bin ) );
167 printf( "bin & mask: %s\n", bits2string( bin & mask ) );
172 /* ---- Anti-sense strand ---- */
174 revcomp_dna( entry->seq );
179 for ( i = 0; entry->seq[ i ]; i++ )
183 switch( entry->seq[ i ] )
185 case 'A': case 'a': add_A( bin ); j++; break;
186 case 'T': case 't': add_T( bin ); j++; break;
187 case 'C': case 'c': add_C( bin ); j++; break;
188 case 'G': case 'g': add_G( bin ); j++; break;
189 default: bin = 0; j = 0; break;
194 array[ ( bin & mask ) ]++;
197 printf( "mask : %s\n", bits2string( mask ) );
198 printf( "bin : %s\n", bits2string( bin ) );
199 printf( "bin & mask: %s\n", bits2string( bin & mask ) );
204 fprintf( stderr, "done.\n" );
209 free( entry->seq_name );
217 void oligo_count_output( char *path, uint *array, uint nmer, uint mask, bool log10_flag )
219 /* Martin A. Hansen, June 2008 */
221 /* Output oligo count for each sequence position. */
235 entry = seq_new( MAX_SEQ_NAME, MAX_SEQ );
237 fp = read_open( path );
239 while ( ( fasta_get_entry( fp, &entry ) ) != 0 )
241 fprintf( stderr, "Writing results for: %s ... ", entry->seq_name );
246 block_size = sizeof( uint ) * ( entry->seq_len + nmer );
247 block = mem_get_zero( block_size );
249 for ( i = 0; entry->seq[ i ]; i++ )
253 switch( entry->seq[ i ] )
255 case 'A': case 'a': add_A( bin ); j++; break;
256 case 'T': case 't': add_T( bin ); j++; break;
257 case 'C': case 'c': add_C( bin ); j++; break;
258 case 'G': case 'g': add_G( bin ); j++; break;
259 default: bin = 0; j = 0; break;
264 count = array[ ( bin & mask ) ];
268 chr_pos = i - nmer + 1;
270 if ( block_pos == 0 )
274 block[ block_pos ] = count;
280 if ( chr_pos > block_beg + block_pos )
282 fixedstep_put_entry( entry->seq_name, block_beg, 1, block, block_pos, log10_flag );
286 memset( block, '\0', block_pos );
290 block[ block_pos ] = count;
301 fixedstep_put_entry( entry->seq_name, block_beg, 1, block, block_pos, log10_flag );
307 fprintf( stderr, "done.\n" );
310 free( entry->seq_name );
318 void fixedstep_put_entry( char *chr, int beg, int step_size, uint *block_array, int block_size, bool log10_flag )
320 /* Martin A. Hansen, June 2008 */
322 /* Outputs a block of fixedStep values. */
328 if ( block_size > 0 )
330 beg += 1; /* fixedStep format is 1 based. */
332 printf( "fixedStep chrom=%s start=%d step=%d\n", chr, beg, step_size );
334 for ( i = 0; i < block_size; i++ ) {
335 printf( "%lf\n", log10( block_array[ i ] ) );
341 if ( block_size > 0 )
343 beg += 1; /* fixedStep format is 1 based. */
345 printf( "fixedStep chrom=%s start=%d step=%d\n", chr, beg, step_size );
347 for ( i = 0; i < block_size; i++ ) {
348 printf( "%i\n", block_array[ i ] );