ZOJ 1027 基因最大匹配值
2016-03-07 14:36
253 查看
Human Gene Functions
Time Limit: 2 Seconds Memory Limit: 65536 KB
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 �C 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 �CGT--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
2
7 AGTGATG
5 GTTAG
7 AGCTATT
9 AGCTTTAAA
Output for the Sample Input
14
21
和Smith-Waterman算法类似
Time Limit: 2 Seconds Memory Limit: 65536 KB
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 �C 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 �CGT--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
2
7 AGTGATG
5 GTTAG
7 AGCTATT
9 AGCTTTAAA
Output for the Sample Input
14
21
和Smith-Waterman算法类似
#include <iostream> #include <string> #include <cstring> #include <map> #define MAX 101 using namespace std; int score[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> word2index; int max(int a, int b, int c){ return max(max(a,b),c); } int main(){ word2index['A'] = 0; word2index['C'] = 1; word2index['G'] = 2; word2index['T'] = 3; word2index['-'] = 4; int n_case, len1, len2; int left, up, up_left; string seq1,seq2; cin>>n_case; int align[MAX][MAX]; for(int i = 0; i < n_case; i++){ cin>>len1>>seq1>>len2>>seq2; memset(align, 0, sizeof(align)); for(int j = 1; j < (len2 + 1); j++){ align[j][0] = align[j-1][0] + score[word2index[seq2[j-1]]][4]; align[j][1] = align[j-1][0] + score[word2index[seq2[j-1]]][word2index[seq1[0]]]; } for(int k = 1; k < (len1 + 1); k++){ align[0][k] = align[0][k-1] + score[word2index[seq1[k-1]]][4]; align[1][k] = align[0][k-1] + score[word2index[seq2[0]]][word2index[seq1[k-1]]]; } for(int j = 2; j < (len2 + 1); j++){ for(int k = 2; k < (len1 + 1); k++){ left = align[j][k-1] + score[word2index[seq1[k-1]]][4]; up = align[j-1][k] + score[word2index[seq2[j-1]]][4]; up_left = align[j-1][k-1] + score[word2index[seq2[j-1]]][word2index[seq1[k-1]]]; align[j][k]= max(left, up, up_left); } } cout<<align[len2][len1]<<endl; } return 0; }
相关文章推荐
- 【机器学习-斯坦福】学习笔记3 - 欠拟合与过拟合概念
- Ubuntu系统的安装与使用:[3]搜狗输入法安装
- IOS的变量修饰词@public 、@protected、@package、@private,简称 4P
- Meta标签中的format-detection属性及含义
- 接口和抽象类
- 用svg矢量图实现动画效果
- Java JPA知识的理解与总结
- Android分享笔记(2) APP启动时闪屏
- level-4
- 240多个jQuery插件
- 阅读生活,享受幸福人生
- guid 新建
- 问与答——其实我很矛盾
- java环境配置正确,但是ecplise打不开,提示java虚拟机找不到
- java实现的第三方线程池框架
- Cisco交换机里IP和MAC地址互查找出对应端口
- Zero Clipboard js+swf实现的复制功能使用方法
- iOS模仿电子书首页实现书架布局样式
- 海盗分金问题
- 股票练习题作业代码