You'll first see how to use dynamic programming to find a longest common subsequence (LCS) of two DNA sequences.
首先将要看到如何运用动态编程查找两个DNA序列的最长公共子序列（longest common subsequence，LCS）。
You'll first see how to use dynamic programming to find a longest common subsequence (LCS) of two DNA sequences.
首先将要看到如何运用动态编程查找两个DNA序列的最长公共子序列（longest common subsequence，LCS）。
应用推荐