| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 19573 | Accepted: 10919 |
Description
A human gene can be identified through a series of time-consuming biological experiments, often with the help of computer programs. Once a sequence of a gene is obtained, the next job is to determine its function.
One of the methods for biologists to use in determining the function of a new gene sequence that they have just identified is to search a database with the new gene as a query. The database to be searched stores many gene sequences and their functions – many researchers have been submitting their genes and functions to the database and the database is freely accessible through the Internet.
A database search will return a list of gene sequences from the database that are similar to the query gene.
Biologists assume that sequence similarity often implies functional similarity. So, the function of the new gene might be one of the functions that the genes from the list have. To exactly determine which one is the right one another series of biological experiments will be needed.
Your job is to make a program that compares two genes and determines their similarity as explained below. Your program may be used as a part of the database search if you can provide an efficient one.
Given two genes AGTGATG and GTTAG, how similar are they? One of the methods to measure the similarity
of two genes is called alignment. In an alignment, spaces are inserted, if necessary, in appropriate positions of
the genes to make them equally long and score the resulting genes according to a scoring matrix.
For example, one space is inserted into AGTGATG to result in AGTGAT-G, and three spaces are inserted into GTTAG to result in –GT--TAG. A space is denoted by a minus sign (-). The two genes are now of equal
length. These two strings are aligned:
AGTGAT-G
-GT--TAG
In this alignment, there are four matches, namely, G in the second position, T in the third, T in the sixth, and G in the eighth. Each pair of aligned characters is assigned a score according to the following scoring matrix.
denotes that a space-space match is not allowed. The score of the alignment above is (-3)+5+5+(-2)+(-3)+5+(-3)+5=9.
Of course, many other alignments are possible. One is shown below (a different number of spaces are inserted into different positions):
AGTGATG
-GTTA-G
This alignment gives a score of (-3)+5+5+(-2)+5+(-1) +5=14. So, this one is better than the previous one. As a matter of fact, this one is optimal since no other alignment can have a higher score. So, it is said that the
similarity of the two genes is 14.
Input
Output
Sample Input
2
7 AGTGATG
5 GTTAG
7 AGCTATT
9 AGCTTTAAA
Sample Output
14
21
题目大意是就是求两基因的相似度，先要在每个基因对中加入若干空格，然后再依次加上匹配度，详见上表，则相似度就是最大的匹配度和
例如对于测试数据一，加上空格则变成
AGTGAT--G
-GT----TAG
则相似度就是（-3）+5+5+（-2）+5+（-1）+5=14，可以证明这是最大的，故为所求
此题为dp,详见代码
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int map[][]={ {,-,-,-,-},
{-,,-,-,-},
{-,-,,-,-},
{-,-,-,,-},
{-,-,-,-,} };
char str1[];
char str2[];
int f[];
bool vis[][];
int ans[][];
int DFS ( int x , int y )
{ int i ;
int xy=;
if ( x == - )
{
for ( i = ; i <= y ; i ++ )
xy += map[str2[i]][] ;
return xy ;
}
if ( y == - )
{
for ( i = ; i <= x ; i ++ )
xy += map[str1[i]][] ;
return xy ;
}
if ( vis[x][y] )
return ans[x][y] ;
vis[x][y]=true;
ans[x][y] = max ( DFS ( x - , y - ) + map[str1[x]][str2[y]] , max ( DFS(x,y-)+map[][str2[y]] , DFS(x-,y)+map[str1[x]][] )) ;
return ans[x][y] ;
}
int main()
{
f['A']=;
f['C']=;
f['-']=;
f['G']=;
f['T']=;
int t ;
cin >> t ;
while ( t -- )
{
int i , j ;
int len1 , len2 ;
cin >> len1 >> str1 ;
for ( i = ; i < len1 ; i ++ )
str1[i]=f[str1[i]]; cin >> len2 >> str2 ;
for ( i = ; i < len2 ; i ++ )
str2[i]=f[str2[i]];
memset ( vis , , sizeof ( vis ) ) ;
cout << DFS(len1-,len2-) << endl ;
}
return ;
}
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm> using namespace std;
/*dp，poj1080*/ int dp[][];//动态规划数据存放
int map[][];//用来存放原始数据 void map_init()
{
map['A']['A']=map['C']['C']=map['G']['G']=map['T']['T']=;
map['A']['C']=map['C']['A']=map['A']['T']=map['T']['A']=map['T'][' ']=map[' ']['T']=-;
map['A']['G']=map['G']['A']=map['C']['T']=map['T']['C']=map['G']['T']=map['T']['G']=map['G'][' ']=map[' ']['G']=-;
map['A'][' ']=map[' ']['A']=map['G']['C']=map['C']['G']=-;
map['C'][' ']=map[' ']['C']=-;
} int max_X3(int a,int b,int c)
{
if(a>b)
{
if(a>c)
return a;
else
return c;
}
else
{
if(b>c)
return b;
else
return c;
}
} int main()
{
int y;//全局次数
int i,j;//循环变量
int a,b;//用户输入
char str1[];
char str2[]; //初始化
map_init(); cin>>y;
while (y--)
{
scanf("%d %s",&a,str1);
scanf("%d %s",&b,str2); //初始化第一行第一列
dp[][]=;
for (i = ; i < a; i++)
dp[][i+] = dp[][i] + map[str1[i]][' ']; for (j = ; j < b; j++)
dp[j+][] = dp[j][] + map[str2[j]][' ']; for (i = ; i <= a; i++)
{
for (j = ; j <= b; j++)
{
dp[j][i] = max_X3(dp[j-][i-]+map[str2[j-]][str1[i-]],
dp[j-][i]+map[str2[j-]][' '],
dp[j][i-]+map[str1[i-]][' ']);
}
} cout<<dp[b][a]<<endl;
}
return ;
}