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
|
/*
* subsetmatr.c
*
*
* Part of TREE-PUZZLE 5.2 (July 2004)
*
* (c) 2003-2004 by Heiko A. Schmidt, Korbinian Strimmer, and Arndt von Haeseler
* (c) 1999-2003 by Heiko A. Schmidt, Korbinian Strimmer,
* M. Vingron, and Arndt von Haeseler
* (c) 1995-1999 by Korbinian Strimmer and Arndt von Haeseler
*
* All parts of the source except where indicated are distributed under
* the GNU public licence. See http://www.opensource.org for details.
*
* ($Id$)
*
*/
#include "subsetmatr.h"
/**********************/
void chooserfromsubsets(cmatrix ssmatr,
imatrix sssets,
ivector sssizes,
int numsets,
int numspecs,
ivector permutation)
{
int i;
int currset, currspec;
int currid;
int first;
int setsize, setfreesize, setcount, speccount;
ivector isfreespec, isfreeset, freeinsubset, subsetoverlap;
isfreespec = new_ivector(numspecs);
for (i = 0; i < numspecs; i++) isfreespec[i] = TRUE;
isfreeset = new_ivector(numsets);
for (i = 0; i < numsets; i++) isfreeset[i] = TRUE;
freeinsubset = new_ivector(numspecs);
subsetoverlap = new_ivector(numsets);
for (i = 0; i < numsets; i++) subsetoverlap[i] = 0;
for (i = 0; i < numsets; i++) isfreeset[i] = TRUE;
currid = 0;
first = TRUE;
for (setcount=0; setcount<numsets; setcount++) {
/* random integer in the range [0, t-1-i] */
do {
currset = randominteger(numsets);
} while(!((isfreeset[currset]) && ((subsetoverlap[currset] >= 3) || first)));
fprintf(stderr, " %3d. %3d (OVL:%d)\n", setcount, currset, subsetoverlap[currset]);
first = FALSE;
isfreeset[currset] = FALSE;
setsize = sssizes[currset];
setfreesize = 0;
for (speccount=0; speccount<setsize; speccount++) {
currspec = sssets[currset][speccount];
if (isfreespec[currspec]) {
freeinsubset[setfreesize++] = currspec;
} /* if isfreespec */
} /* for speccount < setsize */
for (speccount=0; speccount<setfreesize; speccount++) {
do {
currspec = randominteger(setfreesize);
} while(!(isfreespec[freeinsubset[currspec]]));
permutation[currid++] = freeinsubset[currspec];
isfreespec[freeinsubset[currspec]] = FALSE;
for (i=0; i<numsets; i++) {
if (ssmatr[i][freeinsubset[currspec]] == 1) {
(subsetoverlap[i])++;
}
} /* for i */
} /* for speccount */
} /* for setcount */
#if 0
for (i = 0; i < s; i++) {
/* random integer in the range [0, t-1-i] */
j = randominteger(t-i);
k = -1;
l = -1;
do {
k++;
if (isfree[k] == TRUE) l++;
} while ( l != j);
slist[i] = k;
isfree[k] = FALSE;
}
#endif
free_ivector(subsetoverlap);
free_ivector(freeinsubset);
free_ivector(isfreeset);
free_ivector(isfreespec);
} /* chooserfromsubsets */
/**********************/
void fprintsubsets(FILE *fp,
imatrix sssets,
ivector sssizes,
int subsets,
int seqs)
{
int ss; /* subset count */
int sp; /* subset member count */
for (ss=0; ss<subsets; ss++) {
fprintf(fp, "subset[%3d] = ", ss, sssizes[ss]);
for (sp=0; sp<sssizes[ss]; sp++) {
fprintf(fp, "%3d ", sssets[ss][sp]);
} /* for subsets size sp */
fprintf(fp, "(%d) ", sssizes[ss]);
fprintf(fp, "\n");
} /* for all subsets ss */
} /*fprintsubsets */
/**********************/
void printsubsets(imatrix sssets,
ivector sssizes,
int subsets,
int seqs)
{
fprintsubsets(stdout, sssets, sssizes, subsets, seqs);
} /*printsubsets */
/**********************/
void printssmatr(cmatrix subsetmatr,
int subsets,
int seqs)
{
int n1, n2, x;
if (subsets >= 100) {
fprintf(stdout, " | ");
for (n1 = 0; n1 < subsets; n1++) {
x = (n1-(n1%100))/100;
if (x != 0) fprintf(stdout, "%2d", x);
else fprintf(stdout, "%2c", ' ');
}
fprintf(stdout, "\n");
}
if (subsets >= 10) {
fprintf(stdout, " | ");
for (n1 = 0; n1 < subsets; n1++) {
x = (n1-(n1%10))/10;
if (x != 0) fprintf(stdout, "%2d", x);
else fprintf(stdout, "%2c", ' ');
}
fprintf(stdout, "\n");
}
fprintf(stdout, "seq | ");
for (n1 = 0; n1 < subsets; n1++) fprintf(stdout, "%2d", n1%10);
fprintf(stdout, "\n");
fprintf(stdout, "----+-");
for (n1 = 0; n1 < subsets; n1++) fprintf(stdout, "--");
fprintf(stdout, "\n");
for (n2 = 0; n2 < seqs; n2++) {
fprintf(stdout, "s%3d| ", n2);
for (n1 = 0; n1 < subsets; n1++) {
fprintf(stdout, "%2c", ((1 == subsetmatr[n1][n2]) ? 'X' : '.'));
}
fprintf(stdout, "\n");
}
} /* printssmatr */
/**********************/
void readssmatr(FILE *fp,
cmatrix *ssmatr,
imatrix *sslists,
ivector *sssizes,
int *subsets,
int *seqs)
{
int setcount, speccount;
*subsets = 0;
*seqs = 0;
/* read matrix coordinate sizes from file */
fscanf(fp, "%d", subsets);
fscanf(fp, "%d", seqs);
printf("subsets: %d - seqs: %d\n\n", *subsets, *seqs);
/* read to begin of the binary format matrix */
while ('\n' != getc(fp));
/* allocate memory */
*ssmatr = new_cmatrix(*subsets, *seqs);
*sslists = new_imatrix(*subsets, *seqs);
*sssizes = new_ivector(*subsets);
/* initialze values */
for (setcount = 0; setcount < *subsets; setcount++){
(*sssizes)[setcount] = 0;
for (speccount = 0; speccount < *seqs; speccount++){
(*sslists)[setcount][speccount] = *seqs;
} /* for speccount */
} /* for setcount */
/* read matrix from file */
if((*subsets) * (*seqs) != fread(&((*ssmatr)[0][0]), sizeof(char), (*subsets) * (*seqs), fp)) {
fprintf(stderr, "ERROR reading subset matrix from file!!!\n");
exit(1);
}
/* create subset lists/sizes */
for (setcount = 0; setcount < *subsets; setcount++){
for (speccount = 0; speccount < *seqs; speccount++){
if ((*ssmatr)[setcount][speccount] == 1) {
(*sslists)[setcount][((*sssizes)[setcount])] = speccount;
((*sssizes)[setcount])++;
} /* ssmatr == 1 */
} /* for speccount */
} /* for setcount */
} /* readssmatr */
/**********************/
void writessmatr(FILE *fp,
cmatrix subsetmatr,
int subsets,
int seqs)
{
fprintf(fp, " %d %d \n", subsets, seqs);
if(subsets*seqs != fwrite(&(subsetmatr[0][0]), sizeof(char), subsets*seqs, fp)) {
fprintf(stderr, "ERROR writing subset matrix to file!!!\n");
exit(1);
}
} /* writessmatr */
|
