[DP]HOJ 1316Human Gene Functions
来源:互联网 发布:mysql offset查询优化 编辑:程序博客网 时间:2024/04/24 15:01
传送门:Human Gene Functions
Human Gene Functions
Submitted : 418, Accepted : 276
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.
Input
The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. 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
27 AGTGATG5 GTTAG7 AGCTATT9 AGCTTTAAASample Output
1421
解题报告:
此题属于LCS类的问题,但是状态转移方程不是我推出来的。
状态转移方程如下:
1.c[i][j]=max(c[i-1][j-1]+value(a[i],b[j]),c[i][j-1]+value('-',b[j]),c[i-1][j]+value(a[i],'-')) (i,j>0)
2.c[i][0] = c[i-1][0] + value[i]['-']
3.c[0][i] = c[0][i-1] + value['-'][i]
代码如下:
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int Achar[1005]; //A串int Bchar[1005]; //B串char temp[1005];int dp[1005][1005];int value[6][6] = {0,0,0,0,0,0, 0,5,-1,-2,-1,-3, 0,-1,5,-3,-2,-4, 0,-2,-3,5,-2,-2, 0,-1,-2,-2,5,-1, 0,-3,-4,-2,-1,0 };int main(){ int t; int At,Bt; scanf("%d",&t); while(t--){ scanf("%d%s",&At,temp); for(int i=0;i<At;i++){ if(temp[i]=='A') Achar[i]=1; else if(temp[i]=='C') Achar[i]=2; else if(temp[i]=='G') Achar[i]=3; else if(temp[i]=='T') Achar[i]=4; } scanf("%d%s",&Bt,temp); for(int i=0;i<Bt;i++){ if(temp[i]=='A') Bchar[i]=1; else if(temp[i]=='C') Bchar[i]=2; else if(temp[i]=='G') Bchar[i]=3; else if(temp[i]=='T') Bchar[i]=4; } memset(dp,0,sizeof(dp)); for(int i=1;i<Bt;i++) dp[0][i]=dp[0][i-1]+value[5][Bchar[i-1]]; for(int i=1;i<At;i++) dp[i][0]=dp[i-1][0]+value[Achar[i-1]][5]; for(int i=1;i<=At;i++) for(int j=1;j<=Bt;j++) dp[i][j]=max(dp[i-1][j-1]+value[Achar[i-1]][Bchar[j-1]],max(dp[i][j-1]+value[5][Bchar[j-1]],dp[i-1][j]+value[Achar[i-1]][5])); printf("%d\n",dp[At][Bt]); } return 0;}
- [DP]HOJ 1316Human Gene Functions
- Hoj 1316 Human Gene Functions
- Human Gene Functions--DP
- POJ1080 Human Gene Functions DP
- pku1080 Human Gene Functions DP
- Human Gene Functions poj1080 dp
- hdu1080 Human Gene Functions DP
- ZOJ 1027 Human Gene Functions (DP)
- hdu 1080 Human Gene Functions--DP
- POJ 1080 Human Gene Functions DP(LCS)
- POJ 1080 Human Gene Functions DP
- hdu 1080 Human Gene Functions(dp)
- HDU 1080 Human Gene Functions dp
- hdu 1080 dp Human Gene Functions
- hdu 1080 Human Gene Functions (dp)
- HDU 1080 Human Gene Functions (DP)
- (DP)HDU 1080 Human Gene Functions
- dp poj 1080 Human Gene Functions
- Unrecognized Windows Sockets error: 0: JVM_Bind 异常解决办法
- 一个故事告诉你比特币的原理及运作机制
- postfix安装与配置
- Perl笔记:Perl语言入门(第六版) - 智能匹配、given-when
- 看完别人的文章想哭,看到底下的留言更想哭,咋能如此相似
- [DP]HOJ 1316Human Gene Functions
- C#之重构与重载
- RESTful架构风格
- Spring MVC获取客户端传给的json数据
- 【设计模式-外观模式】facade模式
- POJ 1743 后缀数组+分组二分
- 使用share SDK实现人人网授权登录分享(1.x版本)
- SQLQuery接口addScalar方法
- JSONObject与JSONArray的使用