File: motifdiff.c

package info (click to toggle)
wise 2.4.1-21
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 27,140 kB
  • sloc: ansic: 276,365; makefile: 1,003; perl: 886; lex: 93; yacc: 81; sh: 24
file content (300 lines) | stat: -rw-r--r-- 8,514 bytes parent folder | download
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
#include "transfactor.h"
#include "transregion.h"
#include "version.h"
#include "commandline.h"

char * program_name = "motifdiff";

void show_version(FILE * ofp)
{
  fprintf(ofp,"%s\nVersion: %s\nReleased: %s\nCompiled: %s\n",program_name,VERSION_NUMBER,RELEASE_DAY,COMPILE_DATE);
  fprintf(ofp,"\nThis program is freely distributed under a GNU General Public License\n");
  fprintf(ofp,"The source code is copyright (c) EMBL and others\n");
  fprintf(ofp,"There is no warranty, implied or otherwise on the performance of this program\n");
  fprintf(ofp,"For more information read the GNULICENSE file in the distribution\n\n");
  fprintf(ofp,"Credits: Ewan Birney <birney@ebi.ac.uk>\n");
  exit(63);   
}


void show_help(FILE * ofp)
{
  fprintf(ofp,"%s motif-library sequence\n",program_name);
  fprintf(ofp," -lr  motif library is in laurence's format\n");
  fprintf(ofp," -ben motif library is in ben's IUPAC format\n");
  fprintf(ofp," -[no]show_match  - show all matches that pass criteria, default no\n");
  fprintf(ofp," -[no]show_region - show only dense cluster regions, default yes\n");
  fprintf(ofp," -circular [no]   - for randomisation, number of positions to permute\n");

  show_help_TransFactorBuildPara(ofp);

  show_help_TransFactorMatchPara(ofp);

  show_standard_options(ofp);
}



int main(int argc,char ** argv)
{
  TransFactorSet * tfs;
  TransFactorSet * newtfs; /* only used as a temp when permuting */
  TransFactorBuildPara * tfb;
  TransFactorMatchSetCompara * comp;
  TransFactorMatchPara * matchp;
  TransFactorComparaPara * comparap;

  TransFactorMatchSet * one;
  TransFactorMatchSet * two;

  boolean use_laurence = FALSE;
  boolean use_ben = FALSE;
  boolean show_matchset = FALSE;
  boolean show_region  = FALSE;
  boolean show_compara = TRUE;
  boolean show_aln     = FALSE;

  int end_on_seq = 0;
  int seq_count = 0;

  int rotate_number = 0;

  int z;
  int is_gapped;

  int one_pos;
  int two_pos;
  int one_j;
  int two_j;
  int found_match;

  int count;
  int id;
  double perc_id;

  FILE * ifp;
  SeqAlign * sa;

  int i;

  tfb    = new_TransFactorBuildPara_from_argv(&argc,argv);
 
  matchp = new_TransFactorMatchPara_from_argv(&argc,argv);
  matchp->min_relative = 7.0;
  matchp->relative_prob_bits = 0.5;
  matchp->relative_prob = 0.5;
  matchp->type = TFM_RELATIVE;

  strip_out_boolean_def_argument(&argc,argv,"show_match",&show_matchset);
  strip_out_boolean_def_argument(&argc,argv,"show_region",&show_region);
  strip_out_integer_argument(&argc,argv,"circular",&rotate_number);


  if( strip_out_boolean_argument(&argc,argv,"lr") == TRUE ) {
    use_laurence = TRUE;
  }
  if( strip_out_boolean_argument(&argc,argv,"ben") == TRUE ) {
    use_ben = TRUE;
  }


  strip_out_standard_options(&argc,argv,show_help,show_version);


  if( argc != 3 ) {
    show_help(stdout);
    exit(12);
  }

  if( use_laurence == TRUE ) {
    tfs = read_laurence_TransFactorSet_file(argv[1]);
  } else if( use_ben == TRUE ) {
    tfs = read_ben_IUPAC_TransFactorSet_file(argv[1]);
  } else {
    tfs = read_TransFactorSet_file(argv[1]);
  }

  if( tfs->len == 0 ) {
    fatal("No transcription factors in set!");
  }

  build_TransFactorSet(tfs,tfb);

  if( rotate_number > 0 ) {
    fprintf(stdout,"PERMUTED RESULTS - %d rotation\n",rotate_number);
    newtfs = circular_permuted_TransFactorSet(tfs,rotate_number);
    free_TransFactorSet(tfs);
    tfs = newtfs;
  }

  ifp = openfile(argv[2],"r");
  if( ifp == NULL ) {
    fatal("Cannot open %s as input file",argv[2]);
  }

  fprintf(stderr,"Getting into main loop with %s\n",argv[2]);

  while( (sa = read_fasta_SeqAlign(ifp)) ) {
    
    for(i=0;i<sa->len;i++) {
      sa->seq[i]->type = SEQUENCE_DNA;
    }

    if( sa == NULL ) {
      fatal("Could not read fasta alignment in %s",argv[2]);
    }
    
    if( sa->len != 2 ) {
      fatal("Has to be a pairwise alignment");
    }

    fprintf(stderr,"About to calculate...\n");

    one = calculate_TransFactorMatchSet(sa->seq[0],tfs,matchp);

    fprintf(stderr,"calculated transfactor match (one)\n");

    two = calculate_TransFactorMatchSet(sa->seq[1],tfs,matchp);

    fprintf(stderr,"calculated transfactor match (two)\n");

    sort_by_start_TransFactorMatchSet(one);
    sort_by_start_TransFactorMatchSet(two);


    fprintf(stderr,"Sorted\n");
    one_pos = 0;
    two_pos = 0;

    

    
    
    for(i=0;i<sa->seq[0]->len;i++) {
      auto int seen_one = 0;
      auto int seen_two = 0;
      for(one_pos; one_pos < one->len && one->match[one_pos]->start < i;one_pos++) {
	;
      }
      for(two_pos; two_pos < two->len && two->match[two_pos]->start < i;two_pos++) {
	;
      }
      


      if( one_pos < one->len && one->match[one_pos]->start == i ) {
	seen_one = 1;
      } 
      if( two_pos < two->len && two->match[two_pos]->start == i ) {
	seen_two = 1;
      } 
  
      
      if( show_aln && (seen_one == 1 && seen_two == 1)) {
	fprintf(stdout,"Position %d %d,%d\n",i,seen_one,seen_two);
	fprintf(stdout,"    %.12s\n",one->target->seq+i);
	fprintf(stdout,"    %.12s\n",two->target->seq+i);
      }
      

      if( seen_one == 0 && seen_two == 0 ) {
	continue; /* nothing to do */
      }


      is_gapped = FALSE;
      z = i -3;
      if( z < 0 ) { 
	z = 0; 
      }

      for(;z<i+10 && z<sa->seq[0]->len;z++) {
	if( is_gapped_SeqAlign(sa,z) == TRUE ) {
	  is_gapped = TRUE;
	  break;
	}
      }

      if( seen_one == seen_two ) {
	id = 0;
	count = 0;
	for(z=one->match[one_pos]->start;z<one->match[one_pos]->end;z++) {
	  if( toupper(sa->seq[0]->seq[z]) == toupper(sa->seq[1]->seq[z]) ) {
	    id++;
	  } 
	  count++;
	}
	perc_id = (double)id/(double)count;
      }


      /*      fprintf(stdout," %d %d at %d,%d with %d vs %d\n",seen_one,seen_two,one_pos,two_pos,one->match[one_pos]->start,two->match[two_pos]->start);*/

      if( seen_one != seen_two ) {
	/* must have a mismatch */

	/* we no longer want to output mismatches as we are looking at relatives */
	/*
	if( one_pos >= one->len || two_pos >= two->len ) {
	  printf("%s Mismatch at %d AT_END\n",(is_gapped == TRUE ? "GAPPED" : "SOLID"), i);
	} else {
	  printf("%s Mismatch at %d [%d,%d] %s %d %s %d\n",
		 (is_gapped == TRUE ? "GAPPED" : "SOLID"),
		 i,seen_one,seen_two,
		 one->match[one_pos]->factor->name,one->match[one_pos]->start,
		 two->match[two_pos]->factor->name,two->match[two_pos]->start );
	}
	*/

      } else {
	/* if 1,1 still need to check. Will do this later */
	if( seen_one == seen_two && seen_one == 1 ) {
	  if( one->match[one_pos]->factor != two->match[two_pos]->factor ) {

	    /* more than one factor can match at the same position. Need to loop*/
	    found_match = 0;
	    for(one_j=one_pos;one_j < one->len && one->match[one_pos]->start == one->match[one_j]->start;one_j++) {
	      for(two_j=two_pos;two_j < two->len && two->match[two_pos]->start == two->match[two_j]->start;two_j++ ) {
		if( one->match[one_j]->factor == two->match[two_j]->factor && one->match[one_j]->strand == two->match[two_j]->strand ) {
		  found_match = 1;

		  printf("%s %.2f SAME %d %s %d %.2f %.2f %s %d %.2f %.2f\n",
			 (is_gapped == TRUE ? "GAPPED" : "SOLID"), perc_id,		   
			 i,
			 one->match[one_j]->factor->name,one->match[one_j]->start,
			 one->match[one_j]->bit_score,(one->match[one_j]->bit_score - Probability2Bits(one->match[one_j]->factor->max_prob)),
			 two->match[two_j]->factor->name,two->match[two_j]->start,
			 two->match[two_j]->bit_score,(two->match[two_j]->bit_score - Probability2Bits(two->match[two_j]->factor->max_prob)));
		  break;
			 
		} 
	      }
	    }
	    if( found_match == 0 ) {
	      /*      printf("mismatch-covered %d [%d,%d] %s %d %s %d\n",i,seen_one,seen_two,
		     one->match[one_pos]->factor->name,one->match[one_pos]->start,
		     two->match[two_pos]->factor->name,two->match[two_pos]->start );
	      */
	    }
	  } else {
	    if( one->match[one_pos]->strand == two->match[two_pos]->strand ) {
	      printf("%s %.2f SAME %d %s %d %.2f %.2f %s %d %.2f %.2f\n",
		     (is_gapped == TRUE ? "GAPPED" : "SOLID"), perc_id,		   
		     i,
		     one->match[one_pos]->factor->name,one->match[one_pos]->start,
		     one->match[one_pos]->bit_score,(one->match[one_pos]->bit_score - Probability2Bits(one->match[one_pos]->factor->max_prob)),
		     two->match[two_pos]->factor->name,two->match[two_pos]->start,
		     two->match[two_pos]->bit_score,(two->match[two_pos]->bit_score - Probability2Bits(two->match[two_pos]->factor->max_prob))
		     
		     );
	    }
	  }
	}
      }
      
      
    }
    
  }
  
}