POJ 1080-Human Gene Functions(dp)
来源:互联网 发布:淘宝天猫积分怎么兑换 编辑:程序博客网 时间:2024/05/05 18:02
Human Gene Functions
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17478 Accepted: 9732
Description
It is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have been interested in identifying human genes and determining their functions, because these can be used to diagnose human diseases and to design new drugs for them.
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.
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
The input consists of T test cases. The number of test cases ) (T is given in the first line of the input file. Each test case consists of two lines: each line contains an integer, the length of a gene, followed by a gene sequence. The length of each gene sequence is at least one and does not exceed 100.
Output
The output should print the similarity of each test case, one per line.
Sample Input
2 7 AGTGATG 5 GTTAG 7 AGCTATT 9 AGCTTTAAA
Sample Output
1421
题意:给定T组字符串,每组有两个串str1和str2,在两个串中都可以插入空格,使得两个串的长度最后相等,问怎样插入空格形成的由匹配规则得到的值最大。
例如:如示例1 AGTGATG 与 GTTAG (空格用 '_' 表示)
AGTGATG
_GTTA_G
所以最后的结果为 (-3)+5+5+(-2)+5+(-1) +5=14。
思路:dp[i][j]表示第一个字串的长为i的子串与第二个字串的长为j的子串的相似度 。仔细思考可以发现dp[i][j]由下面三种情况推出来:
1.dp[i][j]=dp[i-1][j]+map[str1[i-1]][' ']; 即如果当前的str1[i]!=str2[j],则可以是str1选第i个,str2取空格。
2.dp[i][j-1]+map[' '][str2[j-1]]; 即如果当前的str1[i]!=str2[j],则可以是str2选第i个,str1取空格。
3.dp[i-1][j-1]+map[str1[i-1]][str2[j-1]];即如果当前的str1[i]==str2[j],则可以str1取第i个,str2取第j个
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>#include <set>#include <queue>using namespace std;const int inf=0x3f3f3f3f;int map[110][110];int dp[110][110];char str1[110],str2[110];void init(){ map['A']['A']=map['C']['C']=map['G']['G']=map['T']['T']=5; map['A']['C']=map['C']['A']=map['A']['T']=map['T']['A']=map[' ']['T']=map['T'][' ']=-1; map['A']['G']=map['G']['A']=map['C']['T']=map['T']['C']=map['G']['T']=map['T']['G']=map['G'][' ']=map[' ']['G']=-2; map['A'][' ']=map[' ']['A']=map['C']['G']=map['G']['C']=-3; map['C'][' ']=map[' ']['C']=-4;}int main(){ int T,n,m,i,j; scanf("%d",&T); while(T--){ init(); scanf("%d %s",&n,&str1); scanf("%d %s",&m,&str2); memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++) dp[i][0]=dp[i-1][0]+map[str1[i-1]][' '];// 初始化 for(i=1;i<=m;i++) dp[0][i]=dp[0][i-1]+map[' '][str2[i-1]];//初始化 for(i=1;i<=n;i++) for(j=1;j<=m;j++){ int x1=dp[i-1][j]+map[str1[i-1]][' ']; int x2=dp[i][j-1]+map[' '][str2[j-1]]; int x3=dp[i-1][j-1]+map[str1[i-1]][str2[j-1]]; dp[i][j]=max(x3,max(x1,x2)); } printf("%d\n",dp[n][m]); } return 0;}
0 0
- POJ 1080 Human Gene Functions DP(LCS)
- POJ 1080 Human Gene Functions DP
- dp poj 1080 Human Gene Functions
- POJ 1080 Human Gene Functions DP
- poj 1080 Human Gene Functions(dp)
- poj 1080 Human Gene Functions DP
- POJ 1080-Human Gene Functions(DP)
- POJ 1080-Human Gene Functions(dp)
- POJ 1080 Human Gene Functions(DP)
- POJ 1080 Human Gene Functions(DP)
- POJ 1080 Human Gene Functions dp
- POJ 1080 Human Gene Functions(DP LCS)
- poj 1080 Human Gene Functions DP
- poj--1080 Human Gene Functions(dp)
- poj 1080 Human Gene Functions(dp)
- POJ 1080 Human Gene Functions(DP:LCS)
- POJ-1080 Human Gene Functions(DP)
- POJ 1080 Human Gene Functions(dp)
- iOS8 高德地图SDK MAMapView无法定位的问题
- mysql 的 find_in_set函数使用方法
- ORACLE中的rownum
- 在 Ubuntu 12.04 上安装 Open vSwitch
- spring属性注入
- POJ 1080-Human Gene Functions(dp)
- filter不能过滤struts2中的action
- 滑轮控件研究三、GestureDetector的中手势事件的测试
- Topcoder SRM 648 Div.2 - A(水), B(枚举),C(DP/构造)
- Pascal's Triangle
- Uber 快的 滴滴
- 【转】php,asp与jsp的区别
- superfish的应用
- javascript中prototype方式面向对象编程注意事项