Rosalind第67题：Creating a Character Table from Genetic Strings

Problem

A collection of strings is characterizable if there are at most two possible choices for the symbol at each position of the strings.

Given: A collection of at most 100 characterizable DNA strings, each of length at most 300 bp.

Return: A character table for which each nontrivial character encodes the symbol choice at a single position of the strings. (Note: the choice of assigning '1' and '0' to the two states of each SNP in the strings is arbitrary.)

集合字符串为表征的，如果有在在每个符号最两种可能的选择位置的字符串。

给定：最多100个可表征的DNA字符串的集合，每个字符串的长度最多300 bp。

返回值：一个字符表，每个非平凡字符都会在字符串的单个位置上对符号选择进行编码。（注意：将“ 1”和“ 0”分配给字符串中每个SNP的两个状态是任意的。）

Sample Dataset

ATGCTACC
CGTTTACC
ATTCGACC
AGTCTCCC
CGTCTATC

Sample Output

10110
10100