A subsequence is a sequence that can be derived from another sequence by deletin

Question

A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements; e.g. “acef” is a subsequence of “abcdef.” Consider the problem of finding the longest common subsequence of two sequences – this is a task versioning systems like git or cvs often solve. Show that this is a special case of the sequence alignment problem. Then, give a polynomial-time algorithm for finding the longest subsequence common to three sequences. Analyze its running time and argue why it is correct.

Explanation / Answer

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

/** category LongestCommonSubsequence **/
public category LongestCommonSubsequence
operate lcs **/
public String lcs(String str1, String str2)
science.max(arr[i + 1][j], arr[i][j + 1]);
}
}

int i = 0, j = 0;
StringBuffer sb = new StringBuffer();
whereas (i < l1 && j < l2)
  
else if (arr[i + 1][j] >= arr[i][j + 1])
i++;
else
j++;
}
return sb.toString();
}

/** Main perform **/
public static void main(String[] args) throws IOException
  

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.