受计算生物学中两个蛋白质结构比对问题的启发,定义了三维空间随机步以及两个随机步同构等的概念.研究了步长为k的随机步非同构意义下的个数.最后提出了两个非同构随机步对齐的优化问题,通过研究随机步的同构,采用动态规划给出了将一个随机步对齐到另一个随机步所需最少的操作步数的算法.Inspired by protein structures alignment allowing twist,we propose the problem of comparison of two random walks on a periodic lattice.In this paper we define the isomorphism between two walks and give a dynamic algorithm to find the minimum number of operations to make one walk to be another walk.河北省软科学项目(0545725
