uva1368 - DNA Consensus String

　　　　　　　　　　　　　　

DNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nucleotides, namely Adenine, Thymine, Guanine, and Cytosine as shown in Figure 1. If we represent a nucleotide by its initial character, a DNA strand can be regarded as a long string (sequence of characters) consisting of the four characters A, T, G, and C. For example, assume we are given some part of a DNA strand which is composed of the following sequence of nucleotides:

``Thymine-Adenine-Adenine-Cytosine-Thymine-Guanine-Cytosine-Cytosine-Guanine-Adenine-Thymine"

Then we can represent the above DNA strand with the string ``TAACTGCCGAT." The biologist Prof. Ahn found that a gene X commonly exists in the DNA strands of five different kinds of animals, namely dogs, cats, horses, cows, and monkeys. He also discovered that the DNA sequences of the gene X from each animal were very alike. See Figure 2.

	DNA sequence of gene X
Cat:	GCATATGGCTGTGCA
Dog:	GCAAATGGCTGTGCA
Horse:	GCTAATGGGTGTCCA
Cow:	GCAAATGGCTGTGCA
Monkey:	GCAAATCGGTGAGCA

Figure 2. DNA sequences of gene X in five animals.

Prof. Ahn thought that humans might also have the gene X and decided to search for the DNA sequence of X in human DNA. However, before searching, he should define a representative DNA sequence of gene X because its sequences are not exactly the same in the DNA of the five animals. He decided to use the Hamming distance to define the representative sequence. The Hamming distance is the number of different characters at each position from two strings of equal length. For example, assume we are given the two strings ``AGCAT" and ``GGAAT." The Hamming distance of these two strings is 2 because the 1st and the 3rd characters of the two strings are different. Using the Hamming distance, we can define a representative string for a set of multiple strings of equal length. Given a set of strings S = s₁,..., s_m <tex2html_verbatim_mark>of length n <tex2html_verbatim_mark>, the consensus error between a string y <tex2html_verbatim_mark>of length n <tex2html_verbatim_mark>and the set S <tex2html_verbatim_mark>is the sum of the Hamming distances between y <tex2html_verbatim_mark>and each s_i <tex2html_verbatim_mark>in S<tex2html_verbatim_mark>. If the consensus error between y <tex2html_verbatim_mark>and S <tex2html_verbatim_mark>is the minimum among all possible strings y <tex2html_verbatim_mark>of length n <tex2html_verbatim_mark>, y <tex2html_verbatim_mark>is called a consensus string of S <tex2html_verbatim_mark>. For example, given the three strings ``AGCAT" ``AGACT" and ``GGAAT" the consensus string of the given strings is ``AGAAT" because the sum of the Hamming distances between ``AGAAT" and the three strings is 3 which is minimal. (In this case, the consensus string is unique, but in general, there can be more than one consensus string.) We use the consensus string as a representative of the DNA sequence. For the example of Figure 2 above, a consensus string of gene X is ``GCAAATGGCTGTGCA" and the consensus error is 7.

Input 

Your program is to read from standard input. The input consists of T <tex2html_verbatim_mark>test cases. The number of test cases T<tex2html_verbatim_mark>is given in the first line of the input. Each test case starts with a line containing two integers m <tex2html_verbatim_mark>and n<tex2html_verbatim_mark>which are separated by a single space. The integer m <tex2html_verbatim_mark>(4m50) <tex2html_verbatim_mark>represents the number of DNA sequences andn <tex2html_verbatim_mark>(4n1000) <tex2html_verbatim_mark>represents the length of the DNA sequences, respectively. In each of the next m <tex2html_verbatim_mark>lines, each DNA sequence is given.

Output 

Your program is to write to standard output. Print the consensus string in the first line of each case and the consensus error in the second line of each case. If there exists more than one consensus string, print the lexicographically smallest consensus string. The following shows sample input and output for three test cases.

Sample Input 

3 
5 8 
TATGATAC 
TAAGCTAC 
AAAGATCC 
TGAGATAC 
TAAGATGT 
4 10 
ACGTACGTAC 
CCGTACGTAG 
GCGTACGTAT 
TCGTACGTAA 
6 10 
ATGTTACCAT 
AAGTTACGAT 
AACAAAGCAA 
AAGTTACCTT 
AAGTTACCAA 
TACTTACCAA

Sample Output 

TAAGATAC 
7 
ACGTACGTAA 
6 
AAGTTACCAA 
12
题目大意：给你m个长度为n的DNA串，要求你求出一个DNA序列，使其与m个DNA串字符不同的位置个数最少，如果有多组最优解则输出字典序最小的解。
分析：暴力搜索，m、n的范围还是很小的，枚举每一个的字符，求出最优的填入DNA序列中。总复杂度为O(4*n*m)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxlen 1100
using namespace std;
char str[60][maxlen],ans[maxlen];
char dna[]= {'A','C','G','T'};
int n,m,t;
int main ()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&m,&n);
        gets(ans);
        for(int i=0; i<m; ++i)
        {
            gets(str[i]);
        }
        int sum=0;
        for(int i=0; i<n; ++i)
        {
            int index=0;
            int temp=m+10;
            for(int k=4; k>=0; --k)
            {
                int ham=0;
                for(int j=0; j<m; ++j)
                {
                    ham=ham+(dna[k]!=str[j][i]);
                }
                if(temp>=ham)
                {
                    temp=ham;
                    index=k;
                }
            }
            sum+=temp;
            ans[i]=dna[index];
        }
        ans[n]='\0';
        printf("%s\n%d\n",ans,sum);
    }
}