dna subsequence

基本解释

For example, in DNA sequence, we are usually concerned with the subsequence and its complement.
例如在DNA序列中通常关心字符串和它的补串。
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）。
In the last chapter, we briefly discuss analysis of similarity in view of longest common subsequence problem of DNA sequences.
最后，作为DNA序列比较的一种参照，我们从最长公共子序列的角度考虑了DNA序列的相似性分析，并进行了简单的讨论。