An iteratedalgorithm to count the code distance distribution is derived.
给出了一种计算同步变长码码距分布的迭代算法。
2
The comparison makes it clear that the iteratedalgorithm is concise, precise and quick in bring into effect.
通过把两种算法结果进行比较,表明迭代算法简捷、运行较快、且能达到一定的精度。
3
In the process of global alignment, because the initial value generated by the local alignment is close to the optimum one, the iteratedalgorithm could converge quickly.