public char[] getBestSequence() {
		if (bestSequence == null) {
			bestSequence = new char[length];

			for (int i = 0; i < countMatrix[0].length; i++) {
				int max = 0, maxb = 0;
				for (int b = 0; b < BASES.length; b++) {
					if (max < countMatrix[b][i]) {
						max = countMatrix[b][i];
						maxb = b;
					}
				}
				bestSequence[i] = BASES[maxb];
			}
		}

		return bestSequence;
	}