2
$\begingroup$

Could anyone briefly show me how the Longest Common Sub-sequence of two sequences is a special case of the Sequence Alignment problem? I cannot wrap my head around this. Thank you.

$\endgroup$
2
  • $\begingroup$ Can you state the two problems formally? There might be different versions out there, so this will help us understand your question better. $\endgroup$ Commented Oct 28, 2018 at 23:11
  • $\begingroup$ I think the answer below, explained it well and connected the dots for me. But thanks for the effort! $\endgroup$
    – TypeR
    Commented Oct 28, 2018 at 23:19

1 Answer 1

2
$\begingroup$

The problem of finding a longest common subsequence can be answered by computing the alignment where match is rewarded by +1 while mismatch and insdel penalty are both 0.

$\endgroup$
1
  • $\begingroup$ Ooh, okay thank you! That makes so much sense now. $\endgroup$
    – TypeR
    Commented Oct 28, 2018 at 23:17

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.