-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoutput_contig.c
77 lines (67 loc) · 2.12 KB
/
output_contig.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
/**
>HEADER
Copyright (c) 2004 Haixu Tang [email protected]
This file is part of the RepGraph package.
RepGraph 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.
RepGraph 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 RepGraph. If not, see <http://www.gnu.org/licenses/>.
<HEADER
**/
#include <stdinc.h>
#include <extvab.h>
#include <extfunc.h>
void output_contig(NODES **vertex, int num_vertex, char **src_name, char **src_seq,
int num_seq, FILE *fp, FILE *fp1, FILE *fp2, FILE *fp3);
void writeseq(FILE *fp, char *seq, char *name, int length);
void output_contig(NODES **vertex, int num_vertex, char **src_name, char **src_seq,
int num_seq, FILE *fp, FILE *fp1, FILE *fp2, FILE *fp3)
{
int i, j, k, l, n;
char temp[100];
EDGE *edge;
write_graph(vertex, num_vertex, fp, fp1);
for(i = 0; i < num_vertex; i ++) {
for(j = 0; j < vertex[i] -> num_nextedge; j ++) {
edge = vertex[i] -> nextedge[j];
edge -> visit = 0;
}
}
n = 0;
for(i = 0; i < num_vertex; i ++) {
for(j = 0; j < vertex[i] -> num_nextedge; j ++) {
edge = vertex[i] -> nextedge[j];
if(edge -> visit == 0) {
sprintf(temp, "Contig%d", n);
writeseq(fp2, edge -> seq, temp, edge -> length);
/*
writeace(fp3, edge -> seq, edge -> class, edge -> multip, edge -> length, src_name,
src_seq, num_seq);
*/
n ++;
edge -> visit = edge -> bal_edge -> visit = 1;
}
}
}
printf("# Contigs: %d.\n", n);
}
void writeseq(FILE *fp, char *seq, char *name, int length)
{
int i, j, k;
fprintf(fp, ">%s\n", name);
for(i = 0; i < length; i ++) {
fprintf(fp, "%c", na_name[seq[i]]);
if(i % 50 == 49) {
fprintf(fp, "\n");
}
}
if(i % 50 != 0) {
fprintf(fp, "\n");
}
}