dna subsequence

基本解釋

For example, in DNA sequence, we are usually concerned with the subsequence and its complement.
例如在DNA序列中通常關(guān)心字符串和它的補(bǔ)串。
You'll first see how to use dynamic programming to find a longest common subsequence (LCS) of two DNA sequences.
首先將要看到如何運(yùn)用動(dòng)態(tài)編程查找兩個(gè) DNA 序列的最長(zhǎng)公共子序列（longest common subsequence，LCS）。
In the last chapter, we briefly discuss analysis of similarity in view of longest common subsequence problem of DNA sequences.
最後，作爲(wèi)DNA序列比較的一種蓡照，我們從最長(zhǎng)公共子序列的角度考慮了DNA序列的相似性分析，竝進(jìn)行了簡(jiǎn)單的討論。