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$
  • $\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$ – Yuval Filmus Oct 28 '18 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 Oct 28 '18 at 23:19
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$
  • $\begingroup$ Ooh, okay thank you! That makes so much sense now. $\endgroup$ – TypeR Oct 28 '18 at 23:17

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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