Human Gene Functions
来源:互联网 发布:淘宝号为什么会被监控 编辑:程序博客网 时间:2024/06/11 13:18
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
与LCS类似,稍稍处理一下它的状态转移方程:
dp(i,j)=max(dp(i-1,j-1)+value(a(i-1),b(j-1)),dp(i-1,j)+value(a(i-1),'-'),dp(i,j-1)+value('-',b(j-1)))。
#include <iostream>#include<stack>#include<map>using namespace std;int rel[5][5]={{5,-1,-2,-1,-3},{-1,5,-3,-2,-4},{-2,-3,5,-2,-2},{-1,-2,-2,5,-1},{-3,-4,-2,-1,0}};map<char,int> fun;void func();int maxn(int a,int b,int c);int main(){ char str1[105],str2[105]; int t,n,m; cin>>t; while(t--){ cin>>n>>str1>>m>>str2; func(); int i,j,a,b; int dp[105][105]; dp[0][0]=0; for(i=1;i<=n;i++){ a=fun[str1[i-1]]; dp[i][0]=dp[i-1][0]+rel[a][4]; } for(i=1;i<=m;i++){ b=fun[str2[i-1]]; dp[0][i]=dp[0][i-1]+rel[4][b]; } for(i=1;i<=n;i++){ for(j=1;j<=m;j++){ a=fun[str1[i-1]];b=fun[str2[j-1]]; dp[i][j]=maxn(dp[i-1][j-1]+rel[a][b],dp[i-1][j]+rel[a][4],dp[i][j-1]+rel[4][b]); } } cout<<dp[n][m]<<endl; } return 0;}void func(){ fun['A']=0; fun['C']=1; fun['G']=2; fun['T']=3;}int maxn(int a,int b,int c){ int t; t=b>a?b:a; t=c>t?c:t; return t;}
0 0
- zoj1027 Human Gene Functions
- 1080 Human Gene Functions
- PKU1080 Human Gene Functions
- Human Gene Functions(POJ1080)
- Human Gene Functions
- Human Gene Functions
- ZOJ1027 Human Gene Functions
- pku1080 Human Gene Functions
- Human Gene Functions
- poj1080 - Human Gene Functions
- hdu Human Gene Functions
- 1080--Human Gene Functions
- POJ1080-Human Gene Functions
- POJ1080--Human Gene Functions
- poj1080 Human Gene Functions
- Human Gene Functions
- nyoj-Human Gene Functions
- POJ1080 Human Gene Functions
- char src[]与char *src的区别
- eclipse快捷键
- mysql ERROR 1045 (28000)
- 第一记— Swift版百思不得姐
- 前端问题
- Human Gene Functions
- 【杭电oj】2079 - 选课时间(母函数)
- 路径问题(如何正确写出文件路径)
- String类的用法
- C语言 函数小总结
- java之冒泡,选择,快速排序
- android 黑名单中电话拦截
- ubuntu安装python mysqldb模块
- Codeforces Round #363 (Div. 2) C. Vacations