UVA-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-CytosineCytosine-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.

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 = {s1, … , sm} of length n, the consensus error between a string y of length n and the set S is the sum of the Hamming distances between y and each si
in S. If the consensus error between y and S is the minimum among all possible strings y of length n, y is called a consensus string of S. 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 test cases. The number of test
cases T is given in the first line of the input. Each test case starts with a line containing two integers
m and n which are separated by a single space. The integer m (4 ≤ m ≤ 50) represents the number
of DNA sequences and n (4 ≤ n ≤ 1000) represents the length of the DNA sequences, respectively. In
each of the next m 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.

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

题意：找到一个字符串，找出和所给字符串距离最近的一个串
方法：找到所给串的每一列的最多的那个字符，就是当前位置所要选择的字符

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

const int MAXLEN = 1005;

using namespace std;

typedef struct DNA
{
    int DNA_A;
    int DNA_C;
    int DNA_G;
    int DNA_T;
}DNA;

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        DNA dna[MAXLEN];
        int m, n;
        int con_error = 0;
        char strcon[MAXLEN];
        char strans[MAXLEN];
        scanf("%d %d", &m, &n);
        for(int i=0; i<n; i++)
        {
            dna[i].DNA_A = 0;
            dna[i].DNA_C = 0;
            dna[i].DNA_G = 0;
            dna[i].DNA_T = 0;
        }
        for(int i=0; i<m; i++)
        {
            scanf("%s", strcon);
            for(int j=0; strcon[j] != '\0'; j++)
            {
                if(strcon[j] == 'A')
                    dna[j].DNA_A++;
                else if(strcon[j] == 'C')
                    dna[j].DNA_C++;
                else if(strcon[j] == 'G')
                    dna[j].DNA_G++;
                else if(strcon[j] == 'T')
                    dna[j].DNA_T++;
            }
        }
        for(int i=0; i<n; i++)
        {
            int maxn;
            maxn = max(dna[i].DNA_A, dna[i].DNA_C);
            maxn = max(dna[i].DNA_G, maxn);
            maxn = max(dna[i].DNA_T, maxn);
            if(maxn == dna[i].DNA_A)
            {
                strans[i] = 'A';
                con_error += dna[i].DNA_C;
                con_error += dna[i].DNA_T;
                con_error += dna[i].DNA_G;
            }
            else if(maxn == dna[i].DNA_C)
            {
                strans[i] = 'C';
                con_error += dna[i].DNA_A;
                con_error += dna[i].DNA_G;
                con_error += dna[i].DNA_T;
            }
            else if(maxn == dna[i].DNA_G)
            {
                strans[i] = 'G';
                con_error += dna[i].DNA_A;
                con_error += dna[i].DNA_C;
                con_error += dna[i].DNA_T;
            }
            else if(maxn == dna[i].DNA_T)
            {
                strans[i] = 'T';
                con_error += dna[i].DNA_A;
                con_error += dna[i].DNA_C;
                con_error += dna[i].DNA_G;
            }
        }
        strans[n] = '\0';
        printf("%s\n%d\n", strans, con_error);
    }
    return 0;
}