How is the Longest Common Sub-sequence of two sequences is a special case of the Sequence Alignment problem?

cs.stackexchange https://cs.stackexchange.com/questions/99226

  •  05-11-2019
  •  | 
  •  

题

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.

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top