1 2 3 456 / 6 页下一页

两道题，问了N多人，没结果，再问一下看看 [复制链接]

yuxh

家境小康

论坛徽章:: 1

41楼 [报告]

发表于 2004-12-17 09:05 |只看该作者

两道题，问了N多人，没结果，再问一下看看

[quote]原帖由 "lightspeed"]3) 每个匹配串必须包括全部 ACGT 四个字符。（这是才是有效的基因片断）[/quote 发表：

把程序改一下

#include <stdio.h>;
#include <stdlib.h>;
#include <string.h>;
#include <time.h>;
#define MAXSIZE 10000
#define MINMATCH 10
#define AF 0x01
#define CF 0x02
#define GF 0x04
#define TF 0x08
#define FULLFLAG 0x0F
char strUnit[] = {'A', 'C', 'G', 'T'};
unsigned char hGeneFlag;
int GenQueue(char *strQueue) {
time_t ck;
int nQueueSize,i;
if(strQueue == NULL) return 0;
memset(strQueue, 0, MAXSIZE);
ck = time(NULL);
srand(ck);
nQueueSize = rand() % MAXSIZE;
nQueueSize = MAXSIZE;
for(i = 0; i < nQueueSize; i++) {
strQueue[i] = strUnit[rand() % 4];
}
return nQueueSize;
}
int MatchVerted(char *strQueue, int nQueueSize) {
char *pQueue, strMatch[MAXSIZE / 2 + 1];
int i, nMatchLen, nBegin, nFlag, nPosition;
printf("\nVerted Repeat:\n");
for(nBegin = MINMATCH; nBegin < nQueueSize - MINMATCH; nBegin++) {
pQueue = strQueue + nBegin;
nMatchLen = 0;
nFlag = 0;
hGeneFlag = 0;
for(i = 0; i <= nQueueSize - nBegin; i++) {
if(strQueue[i] == pQueue[i]) {
if(nFlag == 0) {
nFlag = 1;
nPosition = i;
}
switch(strQueue[i]) {
case 'A':
hGeneFlag |= AF;
break;
case 'C':
hGeneFlag |= CF;
break;
case 'G':
hGeneFlag |= GF;
break;
case 'T':
hGeneFlag |= TF;
break;
}
strMatch[nMatchLen++] = strQueue[i];
if(nMatchLen >;= nBegin && hGeneFlag == FULLFLAG) {
strMatch[nMatchLen] = 0;
printf("Repeat:%s, Size: %d, Start Positioins:%d, %d\n", strMatch, nMatchLen, nPosition, nPosition + nBegin);
nFlag = 0;
nPosition = 0;
nMatchLen = 0;
}
}
else {
if(nFlag == 1) {
if(nMatchLen >;= MINMATCH && hGeneFlag == FULLFLAG) {
strMatch[nMatchLen] = 0;
printf("Repeat:%s, Size: %d, Start Positioins:%d, %d\n", strMatch, nMatchLen, nPosition, nPosition + nBegin);
}
nFlag = 0;
nPosition = 0;
nMatchLen = 0;
}
}
}
}
}
int MatchInverted(char *strQueue, int nQueueSize) {
char *pQueue, strMatch[MAXSIZE / 2 + 1];
int i, nMatchLen, nBegin, nFlag, nPosition;
printf("\nInverted Repeat:\n");
for(nBegin = 0; nBegin < nQueueSize - 2 * MINMATCH; nBegin++) {
pQueue = strQueue + nQueueSize - 1 - nBegin;
nMatchLen = 0;
nFlag = 0;
hGeneFlag = 0;
for(i = 0; i < (nQueueSize - nBegin) / 2; i++, pQueue--) {
if(strQueue[i] == *pQueue) {
if(nFlag == 0) {
nFlag = 1;
nPosition = i;
}
switch(strQueue[i]) {
case 'A':
hGeneFlag |= AF;
break;
case 'C':
hGeneFlag |= CF;
break;
case 'G':
hGeneFlag |= GF;
break;
case 'T':
hGeneFlag |= TF;
break;
}
strMatch[nMatchLen++] = strQueue[i];
}
else {
if(nFlag == 1) {
if(nMatchLen >;= MINMATCH && hGeneFlag == FULLFLAG) {
strMatch[nMatchLen] = 0;
printf("Repeat:%s, Size: %d, Start Positioins:%d, %d\n", strMatch, nMatchLen, nPosition, pQueue - strQueue + 1);
}
nFlag = 0;
nPosition = 0;
nMatchLen = 0;
}
}
}
if(nMatchLen >;= MINMATCH && hGeneFlag == FULLFLAG) {
strMatch[nMatchLen] = 0;
printf("Repeat:%s, Size: %d, Start Positioins:%d, %d\n", strMatch, nMatchLen, nPosition, pQueue - strQueue + 1);
}
}
}
int main(void) {
char strQueue[MAXSIZE];
int nQueueSize;
nQueueSize = GenQueue(strQueue);
printf("String:\n%s\n", strQueue);
MatchVerted(strQueue, nQueueSize);
MatchInverted(strQueue, nQueueSize);
}