Mersenne Twister algorithm
UWin unix-windows porter
MEME motif discovery








/* combined file */
#include "heade1.h"
#include
#include
#define NA 3
void main() 
{

	int a,b,nlen,qwer,iii=2*NA+1;
	char c,g;
	  time_t rawtime;
  struct tm * timeinfo;
	char sn[2*NA+1][100];//,final[300];
	char randfiles[][30]={"newrandom01","newrandom02","newrandom03","newrandom04","newrandom05","newrandom06","newrandom07","newrandom08","newrandom09","newrandom10","newrandom11"};
	long nana=0;
	int i=0,j=-1,k=0,abs,o,p;
		char samplen[35];
	char randno[60],randfile[30];
	char stra[100],strb[100],m1[100],m2[100];
	char sn1[100];
		char *token;
	char array[6000][30],input[20000],name[40],flag[6000];
	int counter[6000];
	for(qwer=0;qwer<11;qwer++) {
	//goto skiprand; 
// Parse the random numbers file.
	printf("\nSkip other steps and summarize (y) or skip randomization (r), or skip initial combine(c)?");
	c=getch();
	g=c;
	if(c=='y') goto summ;
	if(c=='r') goto nonrand;
	if(c=='c') goto comb;
	printf("\nEnter random number file name: ");
	//gets(randfile);
	strcpy(randfile,randfiles[qwer]);
	printf(" %s\n",randfile);
	if((fp2=fopen(randfile,"r"))==NULL) printf("error2!");
	if((fp=fopen("random.soft","w"))==NULL) printf("error!");
	while(!feof(fp2)) {
	switch((c=getc(fp2))) {
	case ',':
		putc('^',fp);
		break;

	case ' ': 	case '.': 	case '{': 	case '}':
		break;

	case '`':
		c=getc(fp2);c=getc(fp2);c=getc(fp2);c=getc(fp2);

	default:
		putc(c,fp);
		
	}
	}
	

	

	fclose(fp2);
	fclose(fp);




nonrand:
// Clear.c
printf("\nClearing nonrequired numbers and adding random numbers...\n");
	nana = 1;
	//printf("...");
	//printf("%f",rand());

	if((fp2=fopen("http://www.geocities.com/ramraj_1999/combine1.txt","w"))==NULL) printf("error!");
	if((fp3=fopen("random.soft","r"))==NULL) printf("errorrandom!");
	printf("\nAnalyzing file No.");
	for(o=0;o100000) {printf(".");nana=0;}
			
	}

	
	fclose(fp);
	fclose(fp2);






//Grouper.c
printf("\nGrouping...\n");
	nana = 1;
	printf("Sorting file...");
	system("sort 2ndparse.txt /o 2ndparsesorted.txt");
	printf("done.\n");
	if((fp2=fopen("2ndparsesorted.txt","r"))==NULL) printf("error!");
	if((fp=fopen("grouped.txt","w"))==NULL) printf("error!2");
fscanf(fp2,"%s",stra);
fprintf(fp,"%s\t",stra);
	//printf("|%s|%s|%s|",sn0,sn1,sn2);
		while(!feof(fp2)) {

			for(i=1;itm_min,&timeinfo->tm_hour,&timeinfo->tm_mday,&timeinfo->tm_mon);
		 printf("\a%s",randfile);
	}

// summarizer.c
printf("\nSummarizing...\n");
	nana = 1;
	if(g=='r') { }
	strcat(randfile,"results.txt");
	if((fp=fopen("grouped.txt","r"))==NULL) printf("error!2");
	if((fp2=fopen(randfile,"w"))==NULL) printf("error!3");




	
	while(!feof(fp)) 
	{
		/****** old version *******
		fgets(input,10000,fp);
		
		input[strlen(input)-2]='\0';
		strcpy(name, strtok(input,"\t"));
		//printf("%s\n",name);
		if(strcmp(name,"GTSE")==0) 
			nana=nana;
		for(i=0;;)
		{
			token = strtok(NULL,"|");
			if(token==NULL) break;
			if(!(strcmp(token,"null")==0))
				strcpy(array[i++],token);
			if(i==2999) {printf("\a\a\a\n\nError! not enough array space!"); i=getch();}
		}
		*/

		fgets(input,10000,fp);
		input[strlen(input)-2]='\0';

		i=0;
		while(input[i]!='\t') name[i++]=input[i];
		name[i]='\0';
		j=i;i=0;k=0-1;
		while(input[j]!='\0') {
			
			if(input[j]=='|') { array[i++][k]='\0';k=0;j++;}
			else {array[i][k++]=input[j++];}
			if(i==5999) {printf("Array out of bounds!");fclose(fp2);exit(0);}


		}
		array[i++][k]='\0';
	/*	printf("%s\t%d\n%s",name,i,input);
		getch();
		for(k=0;kcounter[j] ) 
			{
									
				if(counter[j-1]>10)
				{

					if(!(strcmp(array[j-1],name)==0) )
					{
						if(abs==0) {fprintf(fp2,"%\n%s",name);abs++;/*printf("%s\t%d\t%d\n",name,nana++,i);*/}
						if(nana==21)
							nana=21;
						fprintf(fp2,"\t%s*%d",array[j-1],counter[j-1]);
					}
					else
					{
						nlen=counter[j-1];
					}
				}
			}

		}
		if(abs!=0) fprintf(fp2,"\t(%d)",nlen);
		//printf("\n%s\t%d",array[p],counter[p]);
		//break;
	}
	fclose(fp2);
	fclose(fp);

	/*printf("\n\n\nStart over again?");
	c=getch();
	if(c=='y') goto beg;*/
	}

}
Hosted by www.Geocities.ws

1