序列匹配加回溯

题目：

lect6  序列匹配

 

代码：

方法一——普通二维数组序列匹配+开数组回溯：

int maxScore(string word1,string word2,int*& r) {

	int len1 = word1.length();
	int len2 = word2.length();

	vector<vector<int>> temp(len1 + 1, vector<int>(len2 + 1, 0));
	r = new int[len2];

	for (int i = 0; i <= len1; i++) {
		temp[i][0] = -3*i;
	}

	for (int j = 0; j <= len2; j++) {
		temp[0][j] = -3*j;
	}

	for (int i = 1; i <= len1; i++) {
		for (int j = 1; j <= len2; j++) {
			int tl = 0, t = 0, l = 0, res = 0;

			if (word1[i - 1] == word2[j - 1]) {
				tl = temp[i - 1][j - 1]+1;
			}
			else tl = temp[i - 1][j - 1] - 1;

			l = temp[i][j - 1] -3;
			t = temp[i - 1][j] -3;
			res = tl > l ? tl : l;
			res = res > t ? res : t;
			temp[i][j] = res;
		}
	}
	int m = len1, n = len2,tpt=temp[len1][len2];

	for (int i = len2-1; i >= 0; i--) {

		int n1 = temp[m - 1][n - 1]-1;
		int n2 = temp[m - 1][n]-3;
		int n3 = temp[m][n - 1]-3;
		bool flag = false;
		if (word1[m - 1] == word2[n - 1]) {
			n1 = n1 + 2;
			flag = true;
		}

		if (n1 > n2&&n1 > n3) {
			if (flag)r[i] = 0;
			else r[i] = 1;
			m--;
			n--;
		}
		else if (n2 > n3) {
			r[i] = 3;
			m--;
		}
		else {
			r[i] = 2;
			n--;
		}
	}

	return temp[len1][len2];

}

int main() {
	
	vector<int> v = { 2,5};
	string s1 = "ocurrance",s2="occurrence";
	int* r = NULL;
	int res = maxScore(s1, s2,r);
	
	
	return 0;
}

方法二——开两个数组线性空间找，加递归回溯找对齐分割点：

int prefix_alignment(string word1,string word2,int* score) {

	int len1 = word1.length(), len2 = word2.length();
	
	//score = new int[len1 + 1];
	vector<int> newscore(len1 + 1, 0);

	for (int i = 0; i <= len1; i++)score[i] = -3 * i;

	for (int i = 1; i <= len2; i++) {
		newscore[0] = -3 * i;
		for (int j = 1; j <= len1; j++) {
			int tl = score[j - 1] - 1, t = newscore[j - 1] - 3, l = score[j] - 3;
			if (word2[i - 1] == word1[j - 1])tl += 2;

			newscore[j] = max(tl, l);
			newscore[j] = max(newscore[j], t);
		}
		for (int m = 0; m <= len1; m++) {
			score[m] = newscore[m];
		}
	}

	return score[len1];
}

int suffix_alignment(string word1, string word2, int* score) {

	int len1 = word1.length(), len2 = word2.length();

	//score = new int[len1 + 1];
	vector<int> newscore(len1 + 1, 0);
	
	for (int i = 0; i <= len1; i++) {
		score[i] = -3 * (len1 - i);
	}
	for (int i = len2-1; i >= 0; i--) {
		newscore[len1] = -3 * (len2 - i);
		for (int j = len1-1; j >= 0; j--) {

			int tl = score[j + 1]-1, l = score[j]-3, t = newscore[j + 1]-3;
			if (word1[j] == word2[i])tl += 2;

			newscore[j] = max(tl, l);
			newscore[j] = max(newscore[j], t);
		}
		for (int j = len1; j >= 0; j--) {
			score[j] = newscore[j];
		}
	}
	return score[0];
}

int backtrack(string word1,string word2,int& index) {

	int len1= word1.length();
	int len2 = word2.length();

	int* score1 =new int[len1 + 1];
	int* score2 = new int[len1+ 1];
	
	prefix_alignment(word1, word2.substr(0, len2 / 2), score1);
	suffix_alignment(word1, word2.substr(len2 / 2), score2);

	index = 0;
	int res = INT_MIN;
	for (int i = 0; i <= len1; i++) {
		if (score1[i] + score2[i] > res) {
			res = score1[i] + score2[i];
			index = i;
		}
	}
	return res;
}