|
|||||
|
|
| 空间随机行走比对问题的动态规划算法 | |
| 引用本文： | 尚英姿,董宇辰,董涛. 空间随机行走比对问题的动态规划算法[J]. 数学的实践与认识, 2011, 41(2) |
| 作者姓名： | 尚英姿 董宇辰 董涛 |
| 作者单位： | 1. 河北经贸大学数统学院,河北,石家庄,050011 2. 厦门大学经济学院,福建,厦门,361005 3. 河北省老年病医院体检科,河北,石家庄,050011 |
| 基金项目： | 河北省软科学项目(0545725) |
| 摘 要： | 受计算生物学中两个蛋白质结构比对问题的启发,定义了三维空间随机步以及两个随机步同构等的概念.研究了步长为k的随机步非同构意义下的个数.最后提出了两个非同构随机步对齐的优化问题,通过研究随机步的同构,采用动态规划给出了将一个随机步对齐到另一个随机步所需最少的操作步数的算法. |
| 关 键 词： | 随机步 折叠 随机步对齐 特殊正交群 动态规划 |
Alignment of Random Walks by Dynamic Programming |
|
| SHANG Ying-zi,DONG Yu-chen,DONG Tao. Alignment of Random Walks by Dynamic Programming[J]. Mathematics in Practice and Theory, 2011, 41(2) | |
| Authors: | SHANG Ying-zi DONG Yu-chen DONG Tao |
| Affiliation: | SHANG Ying-zi~1,DONG Yu-chen~2,DONG Tao~3 (1.School of mathematics and statistics,Hebei University of Economics and Trade 95 Huai Bei Road,Shijiazhuang 050011,China) (2.School of Economics,Xiamen University 422 Siming Road,Xiaman 361005,China) (3.Physical Examination Center,Hebei Gerontology Hospital,China) |
| Abstract: | 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. |
| Keywords: | random walk folding dynamic programming comparison of random walks special orthogonal group |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |