Description: Longest common subsequence problem LCS (dynamic programming) experimental data: input.txt X = {A, B, C, B, D, A, B} Y = {B, D, C, A, B, A}- required to give X, Y of the longest common subsequence Z, the end run, will result in the output to the file output.txt. Output file contains the answer to the question: can not find the common sub-sequence gives " null" .
To Search:
File list (Check if you may need any files):
3.1\1.cpp
...\1.exe
...\input.txt
...\output.txt
3.1
Download