uva 1368 - DNA Consensus String(字符串处理)

uva 1368 - DNA Consensus String

Figure 1. 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 = 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(4m50)
represents the number of DNA sequences and n(4n1000)
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.
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序列,使其到所有序列的总hamming距离尽量小,如有多解,输出最小解。

解题思路:选出所有基因中每列出现次数最多的,放到结果字符串中(注意若出现次数相同要尽量按字典序小的来)。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char str[55][1005], ans[1005];
int n, m, temp[30], ACGT[4] = {0, 2, 6, 19};
int main() {
	int T;
	scanf("%d\n", &T);
	while (T--) {
		memset(str, 0, sizeof(str));
		memset(ans, 0, sizeof(ans));
		scanf("%d %d\n", &n, &m);
		for (int i = 0; i < n; i++) {
			scanf("%s\n", str[i]);
		}
		int cnt = 0, max, sum = 0, num;
		char ch;
		for (int i = 0; i < m; i++) {
			memset(temp, 0, sizeof(temp));
			max = 0;
			for (int j = 0; j < n; j++) {
				temp[str[j][i] - 'A']++;
			}
			for (int j = 0; j < 4; j++) {
				if (max < temp[ACGT[j]]) {
					max = temp[ACGT[j]];
					ch = ACGT[j] + 'A';
					num = n - temp[ACGT[j]];
				}
			}
			sum += num;
			ans[cnt++] = ch;
		}
		printf("%s\n%d\n", ans, sum);
	}
	return 0;
}
时间: 2024-10-20 07:45:01

uva 1368 - DNA Consensus String(字符串处理)的相关文章

uva 1368 DNA Consensus String 字符串

这学期离散数学的最后一章刚学了类似的东西 什么decoding function和humming distance手算起来才有点难 编程的话就很水了 #include <cstdio> #include <cstring> #include <cstdlib> #include <iostream> #include <algorithm> #include <cmath> #include <set> #include

UVA - 1368 DNA Consensus String

DNA Consensus String Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description  Figure 1. DNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nuc

1368.DNA Consensus String

题目要求是对几个字符串进行分析,得到一个最优的字符串,使它满足与要求的字符串不同的字符之和最小.如果有多种解,则输出字典序最小的. 注意:字符串的结束时 \0  一定要加上 1 #include <cstdio> 2 #include <algorithm> 3 #include <cstring> 4 using namespace std; 5 6 const int maxn=1005; 7 char DNA[55][maxn]; 8 struct node{ 9

UVa1368.DNA Consensus String

原题链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4114 13845357 1368 DNA Consensus String Accepted C++ 0.022 2014-07-07 12:29:30  DNA Consensus String Figure 1. DNA (Deoxyribonucleic Acid) is t

UVA 11636 Hello World,LA 3602 DNA Consensus String,UVA 10970 Big Chocolate,UVA 10340 All in All,UVA 11039 Building Designing

课程好紧啊,只能刷点水题了,几乎都是贪心. UVA 11636 Hello World 二的幂答案就是二进制长度减1,不是二的幂答案就是是二进制长度. #include<cstdio> int main() { int n,kas = 0; while(scanf("%d",&n),n>0){ int r = 0; for(n--;n;n>>=1) r++; printf("Case %d: %d\n",++kas,r); }

UVA1368 UVALive3602 ZOJ3132 DNA Consensus String

Regionals 2006 >> Asia - Seoul 问题链接:UVA1368 UVALive3602 ZOJ3132 DNA Consensus String. 问题简述:给定m个长度为n的DNA序列,求一个DNA序列,使其到所有这些序列的总hamming距离尽量小,如果有多个解,输出字典顺序的最小解. 解题思路:每个DNA序列的长度相同,对每个DNA序列的每一位DNA码进行统计,选取出现次数最多的码,那么这一位的hamming距离最小.依次类推,每一位都选取出现次数最多的码,那么这

UVA 1368 DNA(模拟+贪心)

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

DNA Consensus String,( UVa, 1368 )

题目链接 :https://vjudge.net/problem/UVA-1368 题目首先得知道什么是Hamming距离(自行查找),然后注意出现多个解是选择字典序小者(直接将字典序排号比较),**注意数组大小. 1 #include<stdio.h> 2 #include<string.h> 3 #define maxn 1000 4 #define maxm 1000 5 6 char DNA[maxn][maxm]; 7 int main() 8 { 9 int N; 10

LA 3602 DNA Consensus String (暴力枚举)

题意:给定m个长度为n的DNA序列,求一个最短的DNA序列,使得总Hamming距离最小. Hamming距离等于字符不同的位置个数. 析:看到这个题,我的第一感觉是算时间复杂度,好小,没事,完全可以暴力,只要对每个串的同一个位置, 都选出现最多的,如果有一样的选ASIIC码小的(因为要求字典序小).然后记录最字符和Hamming距离即可. 代码如下: #include <iostream> #include <cstdio> #include <algorithm>