HDU - 1560----DNA sequence
来源:互联网 发布:红豆薏米粉的品牌 知乎 编辑:程序博客网 时间:2024/06/05 18:29
The twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built are A(adenine), C(cytosine), G(guanine), and T(thymine). Finding the longest common subsequence between DNA/Protein sequences is one of the basic problems in modern computational molecular biology. But this problem is a little different. Given several DNA sequences, you are asked to make a shortest sequence from them so that each of the given sequence is the subsequence of it.
For example,given”ACGT”,”ATGC”,”CGTT” and “CAGT”, you can make a sequence in the following way. It is the shortest but may be not the only one.
Input
The first line is the test case number t. Then t test cases follow. In each case, the first line is an integer n ( 1<=n<=8 ) represents number of the DNA sequences. The following k lines contain the k sequences, one per line. Assuming that the length of any sequence is between 1 and 5.
Output
For each test case, print a line containing the length of the shortest sequence that can be made from these sequences.
Sample Input14ACGTATGCCGTTCAGTSample Output8
题目大意:题意就是给出N个长度不定的DNA序列,要求出一个包含这n个序列的最短序列是多长
思路:用到迭代加深搜索—–>可以参考我的这篇 非启发式搜索
#include<iostream>#include<cstring>#include<stdio.h>using namespace std; const int N=8;char str[N][5];int n,ans,depth,size[N];//限制深度char DNA[] = {'A','G','C','T'};void DFS(int tier,int len[]){ int temLen = 0;//预计还要匹配的字符串的最大长度为未匹配到的字符串长度最 for(int i=0 ; i<n ; i++){ if(size[i]-len[i] > temLen){ temLen = size[i]-len[i]; } } if(temLen == 0){//不需要匹配说明已找到 ans = tier; return; } if(tier+temLen > depth){//预计的层+已经搜的层>限制深度,停止搜索 return; } for(int i=0 ; i<4 ; i++){ int newLen[10]; bool flag = false; for(int j=0 ; j<n ; j++){ if(str[j][len[j]] == DNA[i]){//匹配到一个 flag = true; newLen[j] = len[j]+1;//更新匹配长度 }else{ newLen[j] = len[j]; } } if(flag){//没有更新匹配长度说明此情况以搜索过 DFS(tier+1,newLen); } if(ans != 0){//已找到答案,停止搜索 break; } }}int main(void){ int c; cin>>c; while(c--){ cin>>n; depth=0;//初始限制深度 for(int i=0 ; i<n ; i++){ cin>>str[i]; size[i] = strlen(str[i]); if(size[i] > depth){//初始限制深度为最长的字符串长度 depth = size[i]; } } int len[N]={0};//记录了n个字符串已经匹配到的位置 ans = 0; while(true){ DFS(0,len); if(ans == 0){ depth++;//如过没有找到答案,则搜索加深一层 }else{ cout<<ans<<endl; break; } } } return 0;}
- HDU - 1560 DNA sequence
- HDU-1560 DNA sequence
- HDU 1560DNA sequence
- HDU 1560 - DNA sequence
- HDU - 1560----DNA sequence
- HDU - 1560----DNA sequence
- HDU 1560 DNA sequence IDA*
- hdu 1560 DNA sequence(IDA*)
- HDU 1560 DNA sequence(IDA*~)
- HDU 1560 DNA sequence IDA*搜索
- HDU 1560 DNA sequence hh大神代码
- hdu 1560 DNA sequence (IDA*)
- 【搜索进阶】HDU 1560 DNA sequence
- HDU-1560 DNA sequence(IDA*)
- hdu 1560 DNA sequence(IDA*)
- HDU 1560 DNA sequence(BFS+hash)
- HDU 1560 DNA sequence(IDA*搜索)
- HDU 1560 DNA sequence(状压+搜索)
- Codeforces Education round17
- do{...}while(0)
- 关于计算机视觉论文品读
- Markdown使用
- android与h5交互
- HDU - 1560----DNA sequence
- ImportError: /home/jason/anaconda2/bin/../lib/libstdc++.so.6: version `GLIBCXX_3.4.21' not found (re
- Centos修改镜像为国内的阿里云源或者163源等国内源
- 马拦过河卒 递推
- tfs管理命令
- 递归调用的理解
- 抢红包源码
- (三)Redis的配置
- 蓝桥测试2->2015年第四届蓝桥杯省赛A组