Which of the following statements is NOT true about the Longest Common Subsequence (LCS) problem?

Question

Answer

The LCS problem finds the longest common substring between two strings.

Answer

The LCS problem can be solved using dynamic programming.

Answer

The LCS problem involves finding the longest sequence that appears in both strings in the same 
 relative order.

Answer

The LCS problem can be applied in comparing DNA sequences.

Answer

LCS requires that the characters in the sequence appear consecutively in both strings.

Crowdly