As with the LCS algorithm, for each cell you have three choices and pick the maximum one.
同lcs算法一样，对于每个单元格，都有三个选择，要从中选择最大的。
Note that this is an LCS, rather than the LCS, because other common subsequences of the same length might exist.
请注意，这仅是一个LCS，而不是唯一的LCS，因为可能存在其他长度相同的公共子序列。
Truth is, no one has quite figured out what LCS is really for.
事实上，没有人能够相当确定地说出，LCS究竟是做什么用的。
But after a decade of politics and design-by-committee, the LCS has turned out to be anything but small, cheap and numerous.
但在为期十年的政争和委员会设计之后，LCS除了体积小、造价低、数目众多外，便什么也不是了。
Note that you prepend it because you're starting at the end of the LCS.
请注意，之所以将字符放在LCS前端，是因为我们是从LCS末端开始的。
To compute the LCS efficiently using dynamic programming, you start by constructing a table in which you build up partial results.
为了用动态编程有效地计算lcs，首先需要构建一个表格，用它保存部分结果。
In this case, the LCS of S1 and S2 is clearly a zero-length string.
在这种情况下，S1和S2的LCS显然是长度为零的字符串。
Nor could the LCS take on the Type 022 in direct combat and count on winning.
LCS在战斗中也无法直接同022型较量，并指望获得胜利。
Recall that the number in any cell is the length of an LCS of the string prefixes above and below that end in the column and row of that cell.
回想一下，任何单元格中的数字都是该单元格所在行之上和列之前的字符串的LCS长度。
The score in the bottom-right cell contains the maximum alignment score for S1 and S2, just as it contains the length of an LCS in the LCS algorithm.
右下角单元格中的得分包含S1和S2的最大比对得分，就像在LCS 算法中包含 LCS的长度一样。
You'll use these arrows later in "tracing back" to construct an actual LCS (as opposed to just discovering the length of one).
后面的“回溯”一节将用这些箭头建立实际的LCS(与仅仅发现LCS长度相反)。
So, the way you construct an LCS is by starting in the lower-right corner cell and then following the pointer arrows backward.
所以，构建LCS的途径就是从右下角的单元格开始，沿着箭头一路返回。
Finding an LCS is one way of computing how similar two sequences are: the longer the LCS is, the more similar they are.
查找LCS是计算两个序列相似程度的一种方法：LCS越长，两个序列越相似。
And, similarly to the LCS algorithm, to obtain S1 'and S2', you trace back from this bottom-right cell, following the Pointers, and build up S1 'and S2' in reverse.
而且，与LCS算法类似，要获得S1'和S2 '，要从右下角单元格开始沿着指针回溯，反向构建S1 '和S2 '。
The idea is similar to the LCS algorithm.
它的思路与LCS算法相似。
This cell will eventually contain a number that is the length of an LCS of GCGC and GCCCT.
这个单元格最终包含的数字就是GCGC和GCCCT的LCS的长度。
In building up an LCS, this corresponds to adding this character to the LCS.
构建LCS时，这会将相应的字符添加到LCS中。
So, the length of an LCS for these two sequences is 5.
所以，这两个序列的LCS长度是5。
It turns out that an LCS of these two sequences is GCCAG.
这两个序列的LCS是GCCAG。
You'll first see how to use dynamic programming to find a longest common subsequence (LCS) of two DNA sequences.
首先将要看到如何运用动态编程查找两个DNA序列的最长公共子序列（longest commonsubsequence，LCS）。
Finally, you construct an actual LCS using the traceback.
最后，用回溯的方式构建实际的lcs。
Hence, the number in the lower, right-most cell is the length of an LCS of the two strings S1 and S2 - GCCCTAGCG and GCGCAATG in this case.
所以，表格右下角的数字就是字符串s1和S2(在本例中是GCCCTAGCG和GCGCAATG)的LCS的长度。
First, think about how you might compute an LCS recursively. Let.
首先，考虑如何递归地计算lcs。
I love watching Korean teams play. Every single mistake gets punished super hard. I don't think i can go back to LCS.
我喜欢看韩国队玩这个游戏，每一个错误都会受到惩罚。 我不认为我可以回到欧美赛区的怀抱了，简直像菜鸡互啄。
The first LED-LCS signals purchased will be used for field testing.
第一批购买的信号灯将用于实地测试。
The descriptive method of local contour sequence (LCS) is introduced and improved. A method of matching and tracking based on the characteristic of image edge is presented.
介绍了目标轮廓lcs描述，并对其进行改进，建立了基于目标轮廓的特征匹配跟踪方法。
Texas is the first of many populous states that have expressed a need for USA Signal Technology's Intelligent LCS.
得克萨斯是首个向美国信号技术公司购买其智能lcs的人口大州。
Texas is the first of many populous states that have expressed a need for USA Signal Technology's Intelligent LCS.
得克萨斯是首个向美国信号技术公司购买其智能lcs的人口大州。
应用推荐