Blue Jeans
POJ - 3080
The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated.
As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.
A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.
Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.
As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.
A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.
Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.
Input to this problem will begin with a line containing a single integer n indicating the number of datasets. Each dataset consists of the following components:
- A single positive integer m (2 <= m <= 10) indicating the number of base sequences in this dataset.
- m lines each containing a single base sequence consisting of 60 bases.
For each dataset in the input, output the longest base subsequence common to all of the given base sequences. If the longest common subsequence is less than three bases in length, display the string "no significant commonalities" instead. If multiple subsequences of the same longest length exist, output only the subsequence that comes first in alphabetical order.
3 2 GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA 3 GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA GATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA GATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA 3 CATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC ACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
no significant commonalities AGATAC CATCATCAT
code:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int Next[100];
void getNext(char w[],int m){
int i = -1,j = 0;
memset(Next,0,sizeof(Next));
Next[0] = -1;
while(j < m){
if(i == -1 || w[i] == w[j]){
i++,j++;
Next[j] = i;
}
else
i = Next[i];
}
}
bool kmp(char w[],int m,char s[],int n){//w模板串,m模板串长度,s目标串,n目标串长度
int i = 0,j = 0;
getNext(w,m);
while(j < n){
if(i == -1 || w[i] == s[j])
i++,j++;
else
i = Next[i];
if(i >= m)//如果长度大于等于m说明匹配成功
return true;
}
return false;
}
char ans[100];
char str[20][100];
int main(){
int t;
scanf("%d",&t);
bool flag;
char w[100];
while(t--){
int i,j,n,k;
flag = false;
scanf("%d",&n);
for(i = 0; i < n; i++){
scanf("%s",str[i]);
}
int len = strlen(str[0]);
for(i = 0; i < len; i++){
int cnt = 0;
w[cnt++] = str[0][i];//枚举开头
for(j = i+1; j < len; j++){
w[cnt++] = str[0][j];//枚举结尾
for(k = 1; k < n; k++){
if(!kmp(w,cnt,str[k],strlen(str[k])))//与剩下的串一一匹配
break;//有一个串不含模板串就终止
}
if(k >= n){//如果全都含有
if(!flag || cnt > strlen(ans)){//如果是第一答案,或者比原来长,保存替换
w[cnt] = '\0';
strcpy(ans,w);
flag = true;
}
else{
w[cnt] = '\0';
if(cnt == strlen(ans) && strcmp(w,ans) < 0){//如果长度相等保存字典序小的
strcpy(ans,w);
}
}
}
}
}
if(!flag || strlen(ans) < 3){
printf("no significant commonalities\n");
continue;
}
printf("%s\n",ans);
}
return 0;
}