运用这些性质和条件可以缩小几乎最佳屏蔽二进序列偶的搜索范围，提高计算机搜索的效率。
By making use of these properties and conditions, the searching efficiency for the almost perfect punctured binary sequence pairs can be improved significantly.
它计算选择序列的最佳匹配并且将它们画线以便于相同、相似和不同之处可见。
It calculates the best match for the selected sequences, and lines them up so that the identities, similarities and differences can be seen.
最后利用动态规划算法计算已知层序列和被分割序列的最佳匹配距离。
And lastly the optimum matching distances between the sequence of known beds and the resulting sequence are calculated by dynamic programming.
应用推荐