zoukankan      html  css  js  c++  java
  • Blue Jeans POJ 3080 寻找多个串的最长相同子串

    Description

    The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated. 

    As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers. 

    A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC. 

    Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.

    Input

    Input to this problem will begin with a line containing a single integer n indicating the number of datasets. Each dataset consists of the following components:
    • A single positive integer m (2 <= m <= 10) indicating the number of base sequences in this dataset.
    • m lines each containing a single base sequence consisting of 60 bases.

    Output

    For each dataset in the input, output the longest base subsequence common to all of the given base sequences. If the longest common subsequence is less than three bases in length, display the string "no significant commonalities" instead. If multiple subsequences of the same longest length exist, output only the subsequence that comes first in alphabetical order.

    Sample Input

    3
    2
    GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA
    AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
    3
    GATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATACCAGATA
    GATACTAGATACTAGATACTAGATACTAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA
    GATACCAGATACCAGATACCAGATACCAAAGGAAAGGGAAAAGGGGAAAAAGGGGGAAAA
    3
    CATCATCATCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
    ACATCATCATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
    AACATCATCATTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT

    Sample Output

    no significant commonalities
    AGATAC
    CATCATCAT
    

    Source

    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    #include<vector>
    #include<string>
    using namespace std;
    typedef long long LL;
    #define MAXN 63
    /*
    枚举所有子串,用KMP算法检查是否出现过,选择其中的最优解
    */
    char s[MAXN][MAXN];
    int next[MAXN];
    void kmp_pre(char x[])
    {
        int i,j,m=strlen(x);
        j = next[0] = -1;
        i = 0;
        while(i<m)
        {
            if(j!=-1&&x[i]!=x[j])
                j = next[j];
            next[++i] = ++j;
        }
    }
    bool kmp(char x[],char y[])
    {
        int i,j,ans = 0,m=strlen(x),n=strlen(y);
        kmp_pre(x);
        i=j=0;
        while(i<n)
        {
            while(j!=-1&&y[i]!=x[j])
                j = next[j];
            i++;
            j++;
            if(j>=m)
                return true;
        }
        return false;
    }
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            int m;
            char ans[MAXN] = "Z";
            scanf("%d",&m);
            for(int i=0;i<m;i++)
                scanf("%s",s[i]);
            for(int len=60;len>=3;len--)
                for(int i=0;i<=60-len;i++)
                {
                    char b[MAXN] = {0};
                    strncpy(b,s[0]+i,len);
                    //cout<<len<<":"<<b<<endl;
                    int j;
                    for(j=1;j<m;j++)
                    {
                        if(!kmp(b,s[j]))
                            break;
                    }
                    if(j==m&&strcmp(ans,b)>0)
                    {
                        strcpy(ans,b);
                    }
                    if(ans[0]!='Z'&&i==60-len)
                    {
                        i = 999;
                        len = 0;
                    }
                }
                if(ans[0]=='Z')
                    printf("no significant commonalities
    ");
                else 
                    printf("%s
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    centos 新增用户, 然后他在主目录添加网站403Forbbiden
    linux 把用户加入一个组&从这个组中移除
    [THINKPHP] 温故知新之getFieldBy
    php 获取指定月份的开始结束时间
    apache 占用内存总量与每个apache进程的平均内存占用量计算
    网站并发300就很慢
    centos定时备份数据库超简单示例
    php导出excel时间错误(同一个时间戳,用date得到不同的时间)
    设置iframe 载入页面的效果跟直接打开这个页面一样
    node基础09:第2个node web服务器
  • 原文地址:https://www.cnblogs.com/joeylee97/p/6665955.html
Copyright © 2011-2022 走看看