-
Notifications
You must be signed in to change notification settings - Fork 3
/
bear.cc
979 lines (838 loc) · 26 KB
/
bear.cc
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
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
/**
BEAR: BEst-Aigned Rotations
Copyright (C) 2014 Solon P. Pissis.
This program 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.
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
**/
#include <iostream>
#include <cstdlib>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
#include <float.h>
#include <limits.h>
#include <omp.h>
#include <libflasm.h>
#include "globals.h"
#include "EDNAFULL.h"
#include "EBLOSUM62.h"
#include "beardefs.h"
using namespace std;
using namespace libflasm;
int main(int argc, char **argv)
{
struct TSwitch sw;
FILE * in_fd; // the input file descriptor
FILE * out_fd; // the output file descriptor
FILE * outl_fd; // the outliers file descriptor
char * patterns_filename; // the patterns input file name
char * text_filename; // the text input file name
char * output_filename; // the output file name
char * rotations_filename; // the rotations file name
char * outliers_filename; // the outliers file name
struct TPat * pat = NULL;
unsigned char ** seq = NULL; // the sequence(s) in memory
unsigned char ** seq_id = NULL; // the sequence(s) id in memory
unsigned char * t_id = NULL; // the text id in memory
unsigned char * t = NULL; // the text in memory
char * alphabet; // the alphabet
unsigned int i, j;
unsigned int d, q, b;
unsigned int total_length = 0;
int workTotal = 1; // work to be done
int workCompleted = 0; // work completed
/* Decodes the arguments */
i = decode_switches ( argc, argv, &sw );
/* Check the arguments */
if ( i < 7 )
{
usage ();
return ( 1 );
}
else
{
if ( ! strcmp ( "DNA", sw . alphabet ) ) { alphabet = ( char * ) DNA; sw . matrix = 0; }
else if ( ! strcmp ( "RNA", sw . alphabet ) ) { alphabet = ( char * ) RNA; sw . matrix = 0; }
else if ( ! strcmp ( "PROT", sw . alphabet ) ) { alphabet = ( char * ) PROT; sw . matrix = 1; }
else
{
fprintf ( stderr, " Error: alphabet argument a should be `DNA' for nucleotide sequences or `PROT' for protein sequences or `USR' for sequences over a user-defined alphabet!\n" );
return ( 1 );
}
d = sw . d;
if ( d > 3 )
{
usage ();
return ( 1 );
}
if ( d == 0 )
{
if ( sw . D > 1 )
{
fprintf ( stderr, " Error: The distance model (-D) must be either 0 or 1!\n" );
return ( 1 );
}
}
if ( d == 1 )
{
if ( sw . w <= 0 )
{
fprintf ( stderr, " Error: The length of factor (-w) must be larger than 1!\n" );
return ( 1 );
}
if ( sw . D > 1 )
{
fprintf ( stderr, " Error: The distance model (-D) must be either 0 or 1!\n" );
return ( 1 );
}
if ( sw . k >= sw . w )
{
fprintf ( stderr, " Error: The maximum distance (-k) must be smaller than the factor length (-w)!\n" );
return ( 1 );
}
}
if ( d == 2 )
{
if ( sw . R <= 0 || sw . R >= 1 )
{
fprintf ( stderr, " Error: The similarity ratio (-R) must be in (0,1)!\n" );
return ( 1 );
}
if ( sw . O >= 0 )
{
fprintf ( stderr, " Error: The gap opening penalty (-O) must be < 0!\n" );
return ( 1 );
}
if ( sw . E >= 0 )
{
fprintf ( stderr, " Error: The gap extension penalty (-E) must be < 0!\n" );
return ( 1 );
}
if ( sw . A > 1 )
{
fprintf ( stderr, " Error: The alignment type (-A) must be either 0 or 1!\n" );
return ( 1 );
}
}
if ( d == 3 )
{
if ( sw . P < 0 || sw . P >= 49.0 )
{
fprintf ( stderr, " Error: The optional percentage flag should be in the range of 0 to 49%%.\n" );
return ( 1 );
}
if ( sw . q < 2 || sw . q >= sw . b )
{
fprintf ( stderr, " Error: The length of the q-gram must be reasonable.\n" );
return ( 1 );
}
}
patterns_filename = sw . patterns_filename;
if ( patterns_filename == NULL )
{
fprintf ( stderr, " Error: Cannot open file for input!\n" );
return ( 1 );
}
output_filename = sw . output_filename;
text_filename = sw . text_filename;
rotations_filename = sw . rotations_filename;
outliers_filename = sw . outliers_filename;
if ( text_filename != NULL && rotations_filename != NULL )
{
fprintf ( stderr, " Error: Text filename cannot be used with rotations filename!\n" );
return ( 1 );
}
if ( outliers_filename != NULL && rotations_filename != NULL )
{
fprintf ( stderr, " Error: Outliers filename cannot be used with rotations filename!\n" );
return ( 1 );
}
if ( outliers_filename != NULL && text_filename != NULL )
{
fprintf ( stderr, " Error: Outliers filename cannot be used with text filename!\n" );
return ( 1 );
}
omp_set_num_threads( sw . T );
}
double start = gettime();
/* Read the (Multi)FASTA file in memory */
fprintf ( stderr, " Reading the (Multi)FASTA input file: %s\n", patterns_filename );
if ( ! ( in_fd = fopen ( patterns_filename, "r") ) )
{
fprintf ( stderr, " Error: Cannot open file %s!\n", patterns_filename );
return ( 1 );
}
char c;
unsigned int num_seqs = 0; // the total number of sequences considered
unsigned int max_alloc_seq_id = 0;
unsigned int max_alloc_seq = 0;
c = fgetc( in_fd );
do
{
if ( c != '>' )
{
fprintf ( stderr, " Error: input file %s is not in FASTA format!\n", patterns_filename );
return ( 1 );
}
else
{
if ( num_seqs >= max_alloc_seq_id )
{
seq_id = ( unsigned char ** ) realloc ( seq_id, ( max_alloc_seq_id + ALLOC_SIZE ) * sizeof ( unsigned char * ) );
max_alloc_seq_id += ALLOC_SIZE;
}
unsigned int max_alloc_seq_id_len = 0;
unsigned int seq_id_len = 0;
seq_id[ num_seqs ] = NULL;
while ( ( c = fgetc( in_fd ) ) != EOF && c != '\n' )
{
if ( seq_id_len >= max_alloc_seq_id_len )
{
seq_id[ num_seqs ] = ( unsigned char * ) realloc ( seq_id[ num_seqs ], ( max_alloc_seq_id_len + ALLOC_SIZE ) * sizeof ( unsigned char ) );
max_alloc_seq_id_len += ALLOC_SIZE;
}
seq_id[ num_seqs ][ seq_id_len++ ] = c;
}
seq_id[ num_seqs ][ seq_id_len ] = '\0';
}
if ( num_seqs >= max_alloc_seq )
{
seq = ( unsigned char ** ) realloc ( seq, ( max_alloc_seq + ALLOC_SIZE ) * sizeof ( unsigned char * ) );
max_alloc_seq += ALLOC_SIZE;
}
unsigned int seq_len = 0;
unsigned int max_alloc_seq_len = 0;
seq[ num_seqs ] = NULL;
while ( ( c = fgetc( in_fd ) ) != EOF && c != '>' )
{
if( seq_len == 0 && c == '\n' )
{
fprintf ( stderr, " Omitting empty sequence in file %s!\n", patterns_filename );
c = fgetc( in_fd );
break;
}
if( c == '\n' || c == ' ' ) continue;
c = toupper( c );
if ( seq_len >= max_alloc_seq_len )
{
seq[ num_seqs ] = ( unsigned char * ) realloc ( seq[ num_seqs ], ( max_alloc_seq_len + ALLOC_SIZE ) * sizeof ( unsigned char ) );
max_alloc_seq_len += ALLOC_SIZE;
}
if( strchr ( alphabet, c ) )
{
seq[ num_seqs ][ seq_len++ ] = c;
}
else
{
fprintf ( stderr, " Error: input file %s contains an unexpected character %c!\n", patterns_filename, c );
return ( 1 );
}
}
if( seq_len != 0 )
{
if ( seq_len >= max_alloc_seq_len )
{
seq[ num_seqs ] = ( unsigned char * ) realloc ( seq[ num_seqs ], ( max_alloc_seq_len + ALLOC_SIZE ) * sizeof ( unsigned char ) );
max_alloc_seq_len += ALLOC_SIZE;
}
seq[ num_seqs ][ seq_len ] = '\0';
total_length += seq_len;
num_seqs++;
}
} while( c != EOF );
workTotal = num_seqs * num_seqs - num_seqs;
seq[ num_seqs ] = NULL;
pat = ( TPat * ) calloc ( num_seqs , sizeof ( TPat ) );
if( ( pat == NULL) )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
for ( i = 0; i < num_seqs; i ++ )
{
if ( i == 0 ) pat[i] . start = 0;
else pat[i] . start += pat[i - 1] . start + strlen ( ( char * ) seq[ i - 1 ] );
pat[i] . offset = 0;
}
if ( fclose ( in_fd ) )
{
fprintf( stderr, " Error: file close error!\n");
return ( 1 );
}
if ( rotations_filename != NULL )
{
if ( ! ( out_fd = fopen ( rotations_filename, "w") ) )
{
fprintf ( stderr, " Error: Cannot open file %s!\n", rotations_filename );
return ( 1 );
}
for ( i = 0; i < num_seqs; i ++ )
{
unsigned char * tmp;
unsigned int l = strlen ( ( char * ) seq[i] );
tmp = ( unsigned char * ) malloc ( ( l + 1 ) * sizeof ( unsigned char ) );
if( ( tmp == NULL) )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
int cp = rand() % ( l ) + 1;
memcpy ( tmp, &seq[i][cp], l - cp );
memcpy ( &tmp[l - cp], &seq[i][0], cp );
tmp[l] = '\0';
fprintf( out_fd, ">%s\n", seq_id[i]);
fprintf( out_fd, "%s\n", tmp);
free ( tmp );
}
if ( fclose ( out_fd ) )
{
fprintf( stderr, " Error: file close error!\n");
return ( 1 );
}
}
else if ( text_filename != NULL )
{
fprintf ( stderr, " Reading the FASTA input file: %s\n", text_filename );
if ( ! ( in_fd = fopen ( text_filename, "r") ) )
{
fprintf ( stderr, " Error: Cannot open file %s!\n", text_filename );
return ( 1 );
}
c = fgetc( in_fd );
if ( c != '>' )
{
fprintf ( stderr, " Error: input file %s is not in FASTA format!\n", text_filename );
return ( 1 );
}
else
{
unsigned int max_alloc_t_id_len = 0;
unsigned int t_id_len = 0;
while ( ( c = fgetc( in_fd ) ) != EOF && c != '\n' )
{
if ( t_id_len >= max_alloc_t_id_len )
{
t_id = ( unsigned char * ) realloc ( t_id, ( max_alloc_t_id_len + ALLOC_SIZE ) * sizeof ( unsigned char ) );
max_alloc_t_id_len += ALLOC_SIZE;
}
t_id[ t_id_len++ ] = c;
}
t_id[ t_id_len ] = '\0';
}
unsigned int t_len = 0;
unsigned int max_alloc_t_len = 0;
while ( ( c = fgetc( in_fd ) ) != EOF )
{
if( t_len == 0 && c == '\n' )
{
fprintf ( stderr, " Error: empty sequence in file %s!\n", text_filename );
return ( 1 );
}
if( c == '\n' ) continue;
c = toupper( c );
if ( t_len >= max_alloc_t_len )
{
t = ( unsigned char * ) realloc ( t, ( max_alloc_t_len + ALLOC_SIZE ) * sizeof ( unsigned char ) );
max_alloc_t_len += ALLOC_SIZE;
}
if( strchr ( alphabet, c ) )
{
t[ t_len++ ] = c;
}
else
{
fprintf ( stderr, " Error: input file %s contains an unexpected character %c!\n", text_filename, c );
return ( 1 );
}
}
if( t_len != 0 )
{
if ( t_len >= max_alloc_t_len )
{
t = ( unsigned char * ) realloc ( t, ( max_alloc_t_len + ALLOC_SIZE ) * sizeof ( unsigned char ) );
max_alloc_t_len += ALLOC_SIZE;
}
t[ t_len ] = '\0';
}
if ( fclose ( in_fd ) )
{
fprintf( stderr, " Error: file close error!\n");
return ( 1 );
}
/* Allocate the occurences structure */
TPOcc ** POcc = NULL;
POcc = ( TPOcc ** ) calloc ( num_seqs , sizeof ( TPOcc * ) );
if( ( POcc == NULL) )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
for ( i = 0; i < num_seqs; i ++ )
POcc[i] = NULL;
unsigned int * NOcc;
NOcc = ( unsigned int * ) calloc ( num_seqs , sizeof ( unsigned int ) );
if( ( NOcc == NULL) )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
/* Multiple Circular Approximate String Matching */
fprintf ( stderr, " Starting the multiple circular approximate string matching\n" );
if ( sw . D == 0 ) //AR Edit to if ( d==0 )
{
if ( ! ( macsmf_hd ( seq, t, sw, &POcc, &NOcc ) ) )
{
fprintf( stderr, " Error: macsmf_ms() failed!\n" );
exit(EXIT_FAILURE);
}
}
else
{
if ( ! ( macsmf_ed ( seq, t, sw, &POcc, &NOcc ) ) )
{
fprintf( stderr, " Error: macsmf_ms() failed!\n" );
exit(EXIT_FAILURE);
}
}
fprintf ( stderr, " Preparing the output\n" );
if ( ! ( out_fd = fopen ( output_filename, "w") ) )
{
fprintf ( stderr, " Error: Cannot open file %s!\n", output_filename );
return ( 1 );
}
for ( i = 0; i < num_seqs; i ++ )
{
for ( int j = 0; j < NOcc[i]; j ++ )
{
if ( d == 0 )
fprintf( out_fd, "%s %s %d %d %d\n", seq_id[i], seq[i], POcc[i][j] . pos, ( int ) POcc[i][j] . err, POcc[i][j] . rot );
else
fprintf( out_fd, "%s %s %d %lf %d\n", seq_id[i], seq[i], POcc[i][j] . pos, POcc[i][j] . err, POcc[i][j] . rot );
}
}
if ( fclose ( out_fd ) )
{
fprintf( stderr, " Error: file close error!\n");
return ( 1 );
}
free ( t_id );
free ( t );
free ( NOcc );
for ( i = 0; i < num_seqs; i ++ )
free ( POcc[i] );
free ( POcc);
}
else
{
/* D[i,j] stores distance( x^{rot}_{i}, x_{j} ) = err */
TPOcc ** D;
int * R;
R = ( int * ) calloc ( num_seqs , sizeof ( int ) );
if ( d == 0 )
{
fprintf ( stderr, " Comparison model: small pairwise distance.\n" );
if ( ( D = ( TPOcc ** ) calloc ( ( num_seqs ) , sizeof( TPOcc * ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
for ( int i = 0; i < num_seqs; i++ )
{
if ( ( D[i] = ( TPOcc * ) calloc ( ( num_seqs ) , sizeof( TPOcc ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
}
if ( sw . D == 0 )
{
fprintf ( stderr, " Distance model: Hamming distance with k = %d.\n", sw . k );
printProgress ( workCompleted, workTotal );
//#pragma omp parallel for
for ( int i = 0; i < num_seqs; i++ )
{
unsigned int m = strlen ( ( char * ) seq[i] );
if ( ( double ) sw . k / m > 0.10 )
fprintf ( stderr, " Warning: Error ratio %lf is too high for this method.\n", ( double ) sw . k / m );
for ( int j = 0; j < num_seqs; j ++ )
{
if ( i == j ) continue;
unsigned int n = strlen ( ( char * ) seq[j] );
/* Initialise the arrays */
D[i][j] . err = DBL_MAX;
unsigned int distance = ( int ) DBL_MAX;
unsigned int rotation = 0;
pcsa_hd ( seq[i], seq[j], sw, &rotation, &distance );
D[i][j] . err = distance;
D[i][j] . rot = rotation;
workCompleted ++;
printProgress ( workCompleted, workTotal );
}
}
}
else
{
fprintf ( stderr, " Distance model: edit distance with k = %d.\n", sw . k );
printProgress ( workCompleted, workTotal );
//#pragma omp parallel for
for ( int i = 0; i < num_seqs; i++ )
{
unsigned int m = strlen ( ( char * ) seq[i] );
if ( ( double ) sw . k / m > 0.10 )
fprintf ( stderr, " Warning: Error ratio %lf is too high for this method.\n", ( double ) sw . k / m );
for ( int j = 0; j < num_seqs; j ++ )
{
if ( i == j ) continue;
unsigned int n = strlen ( ( char * ) seq[j] );
/* Initialise the arrays */
D[i][j] . err = DBL_MAX;
unsigned int distance = ( int ) DBL_MAX;
unsigned int rotation = 0;
pcsa_ed ( seq[i], seq[j], sw, &rotation, &distance );
D[i][j] . err = distance;
D[i][j] . rot = rotation;
workCompleted ++;
printProgress ( workCompleted, workTotal );
}
}
}
}
if ( d == 1 )
{
fprintf ( stderr, " Comparison model: pairwise distance of fixed-length factors.\n" );
if ( ( D = ( TPOcc ** ) calloc ( ( num_seqs ) , sizeof( TPOcc * ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
if ( sw . D == 0 )
{
fprintf ( stderr, " Distance model: Hamming distance with w = %d and k = %d.\n", sw . w, sw . k );
}
else
{
fprintf ( stderr, " Distance model: edit distance with w = %d and k = %d.\n", sw . w, sw . k );
}
printProgress ( workCompleted, workTotal );
/* For every sequence i */
#pragma omp parallel for
for ( int i = 0; i < num_seqs; i++ )
{
unsigned int m = strlen ( ( char * ) seq[i] );
if ( ( D[i] = ( TPOcc * ) calloc ( ( num_seqs ) , sizeof( TPOcc ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
unsigned char * xiw;
xiw = ( unsigned char * ) calloc ( m + sw . w, sizeof( unsigned char ) );
memmove( &xiw[0], seq[i], m );
memmove( &xiw[m], seq[i], sw . w - 1 );
xiw[m + sw . w - 1] = '\0';
unsigned int mm = m + sw . w - 1;
for ( int j = 0; j < num_seqs; j ++ )
{
if ( i == j ) continue;
/* Here we compute these coordinates using libFLASM and store it to M[ii] */
unsigned int n = strlen ( ( char * ) seq[j] );
D[i][j] . err = m - 1;
unsigned int ii, jj;
unsigned int distance = ( unsigned int ) DBL_MAX;
unsigned int l = min ( sw . w, m );
if ( sw . D == 0 )
{
ResultTupleSet results = flasm_hd ( seq[j], n, xiw, mm, l, sw . k, false );
if ( results . size () > 0 ) {
ResultTupleSetIterator it = results . begin();
ii = ( * it ) . pos_x;
jj = ( * it ) . pos_t;
distance = ( * it ) . error;
}
}
else
{
ResultTupleSet results = flasm_ed ( seq[j], n, xiw, mm, l, sw . k, false );
if ( results . size () > 0 ) {
ResultTupleSetIterator it = results . begin();
ii = ( * it ) . pos_x;
jj = ( * it ) . pos_t;
distance = ( * it ) . error;
}
}
D[i][j] . err = distance;
/* If ii >= jj then it is easy to find the rotation: ii - jj */
if ( ii >= jj )
{
D[i][j] . rot = ii - jj;
}
/* Otherwise we would need to shift jj - ii or as many letters as we have on the right of position i - sw. w + 1 */
else
{
int a = jj - ii;
int b = m - ii - 1;
int c = min ( a, b );
D[i][j] . rot = m - c;
}
workCompleted ++;
printProgress ( workCompleted, workTotal );
}
free ( xiw );
}
}
if ( d == 2 )
{
fprintf ( stderr, " Comparison model: affine gap penalty with sub matrices.\n" );
if ( ( D = ( TPOcc ** ) calloc ( ( num_seqs ) , sizeof( TPOcc * ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
/* Estimate the minimum pairwise allowed similarity */
double total_score = 0;
for ( i = 0; i < num_seqs; i ++ )
{
unsigned int l = strlen ( ( char * ) seq[i] );
for ( int j = 0; j < l; j++ )
total_score += ( sw . matrix ? pro_delta( seq[i][j], seq[i][j] ) : nuc_delta( seq[i][j], seq[i][j] ) ) ;
}
sw . min_sim = ( total_score * sw . R ) / ( num_seqs );
if ( sw . A == 1 )
{
fprintf ( stderr, " Alignment type: local with O = %lf and E = %lf.\n", sw . O, sw . E );
fprintf( stderr, " The minimum allowed similarity score is %lf.\n", sw . min_sim );
printProgress ( workCompleted, workTotal );
/* For every sequence i */
#pragma omp parallel for
for ( int i = 0; i < num_seqs; i++ )
{
unsigned int m = strlen ( ( char * ) seq[i] );
if ( ( D[i] = ( TPOcc * ) calloc ( ( num_seqs ) , sizeof( TPOcc ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
unsigned char * xx;
xx = ( unsigned char * ) calloc ( m + m, sizeof( unsigned char ) );
memmove( &xx[0], seq[i], m );
memmove( &xx[m], seq[i], m - 1 );
xx[m + m - 1] = '\0';
unsigned int mm = m + m - 1;
for ( int j = 0; j < num_seqs; j ++ )
{
if ( i == j ) continue;
unsigned int n = strlen ( ( char * ) seq[j] );
D[i][j] . err = -DBL_MAX;
unsigned int ii, jj;
double similarity = -DBL_MAX;
sw_ls ( xx, mm, seq[j], n, sw, &ii, &jj, &similarity );
D[i][j] . err = similarity;
/* If ii >= jj then it is easy to find the rotation: ii - jj */
if ( ii >= jj )
{
D[i][j] . rot = ii - jj;
}
/* Otherwise we would need to shift jj - ii or as many letters as we have on the right of position i - sw. w + 1 */
else
{
int a = jj - ii;
int b = m - ii - 1;
int c = min ( a, b );
D[i][j] . rot = m - c;
}
workCompleted ++;
printProgress ( workCompleted, workTotal );
}
free ( xx );
}
}
else
{
fprintf ( stderr, " Alignment type: global with O = %lf and E = %lf.\n", sw . O, sw . E );
fprintf( stderr, " The minimum allowed similarity score is %lf.\n", sw . min_sim );
for ( int i = 0; i < num_seqs; i++ )
{
unsigned int m = strlen ( ( char * ) seq[i] );
if ( ( D[i] = ( TPOcc * ) calloc ( ( num_seqs ) , sizeof( TPOcc ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
}
printProgress ( workCompleted, workTotal );
/* For every sequence i */
#pragma omp parallel for
for ( int i = 0; i < num_seqs; i++ )
{
unsigned int m = strlen ( ( char * ) seq[i] );
for ( int j = 0; j < num_seqs; j ++ )
{
if ( i == j ) continue;
unsigned int n = strlen ( ( char * ) seq[j] );
/* Initialise the arrays */
D[i][j] . err = -DBL_MAX;
double score = -DBL_MAX;
int rot = 0;
cyc_nw_ls ( seq[i], m, seq[j], n, sw, &score, &rot );
D[i][j] . err = score;
D[i][j] . rot = rot;
workCompleted ++;
printProgress ( workCompleted, workTotal );
}
}
}
}
if ( d == 3 )
{
fprintf ( stderr, " Comparison model: blockwise q-gram distance.\n" );
if ( ( D = ( TPOcc ** ) calloc ( ( num_seqs ) , sizeof( TPOcc * ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
fprintf ( stderr, " Length of block = %d, q = %d and refinement %1.2f%%.\n", sw . b, sw . q, sw . P );
printProgress ( workCompleted, workTotal );
/* For every sequence i */
#pragma omp parallel for
for ( int i = 0; i < num_seqs; i++ )
{
unsigned int m = strlen ( ( char * ) seq[i] );
if ( ( D[i] = ( TPOcc * ) calloc ( ( num_seqs ) , sizeof( TPOcc ) ) ) == NULL )
{
fprintf( stderr, " Error: Cannot allocate memory!\n" );
exit( EXIT_FAILURE );
}
for ( int j = 0; j < num_seqs; j ++ )
{
if ( i == j ) continue;
unsigned int n = strlen ( ( char * ) seq[j] );
if ( sw . b > m - sw . q + 1 || sw . b > n - sw . q + 1 )
{
fprintf( stderr, " Error: Illegal block length.\n" );
exit ( 1 );
}
sw . k = n + m;
unsigned int distance = ( int ) DBL_MAX;
unsigned int rotation = 0;
circular_sequence_comparison ( seq[i], seq[j], sw, &rotation, &distance );
D[i][j] . err = (double) distance;
D[i][j] . rot = rotation;
workCompleted ++;
printProgress ( workCompleted, workTotal );
}
}
}
#if 0
for ( int i = 0; i < num_seqs; i ++ )
{
for ( int j = 0; j < num_seqs; j ++ )
{
fprintf( stderr, "%lf ", D[i][j] . err );
}
fprintf( stderr, "\n" );
}
for ( int i = 0; i < num_seqs; i ++ )
{
for ( int j = 0; j < num_seqs; j ++ )
{
fprintf( stderr, "%d ", D[i][j] . rot );
}
fprintf( stderr, "\n" );
}
#endif
fprintf ( stderr, " Starting the clustering\n" );
if ( d == 0 || d == 1 || d == 3 )
upgma_dist ( D, num_seqs, sw, R, seq );
else if ( d == 2 )
upgma_sim ( D, num_seqs, sw, R, seq );
fprintf ( stderr, " Preparing the output\n" );
if ( ! ( out_fd = fopen ( output_filename, "w") ) )
{
fprintf ( stderr, " Error: Cannot open file %s!\n", output_filename );
return ( 1 );
}
unsigned int succ = 0;
unsigned int unsucc = 0;
for ( i = 0; i < num_seqs; i ++ )
{
if ( R[i] >= 0 )
{
R[i] = R[i] % strlen ( ( char * ) seq[i] );
unsigned char * rotation;
unsigned int m = strlen ( ( char * ) seq[i] );
rotation = ( unsigned char * ) calloc ( m + 1, sizeof ( unsigned char ) );
create_rotation ( seq[i], R[i], rotation );
fprintf( out_fd, ">%s\n", seq_id[i] );
fprintf( out_fd, "%s\n", rotation );
free ( rotation );
succ++;
}
else
{
if ( outliers_filename != NULL )
{
if ( unsucc == 0 )
{
if ( ! ( outl_fd = fopen ( outliers_filename, "w") ) )
{
fprintf ( stderr, " Error: Cannot open file %s!\n", outliers_filename );
return ( 1 );
}
}
fprintf( outl_fd, ">%s\n", ( char * ) seq_id[i] );
fprintf( outl_fd, "%s\n", ( char * ) seq[i] );
unsucc++;
}
}
}
fprintf ( stderr, "%d/%d sequences were succesfully rotated.\n", succ, num_seqs );
if ( fclose ( out_fd ) )
{
fprintf( stderr, " Error: file close error!\n");
return ( 1 );
}
if ( outliers_filename != NULL && unsucc > 0 )
{
if ( fclose ( outl_fd ) )
{
fprintf( stderr, " Error: file close error!\n");
return ( 1 );
}
}
free ( R );
for ( i = 0; i < num_seqs; i ++ )
{
free ( D[i] );
}
free ( D );
}
double end = gettime();
fprintf( stderr, "Elapsed time for processing %d sequence(s): %lf secs.\n", num_seqs, ( end - start ) );
/* Deallocate */
for ( i = 0; i < num_seqs; i ++ )
{
free ( seq[i] );
free ( seq_id[i] );
}
free ( seq );
free ( seq_id );
free ( pat );
free ( sw . patterns_filename );
if ( outliers_filename != NULL )
free ( sw . outliers_filename );
if ( text_filename != NULL )
free ( sw . text_filename );
if ( rotations_filename != NULL )
free ( sw . rotations_filename );
free ( sw . output_filename );
free ( sw . alphabet );
return ( 0 );
}