| 基于动态规划算法实现代价最小的字符串输出 |
| |
| 引用本文： | 李大辉 苏桂贤. 基于动态规划算法实现代价最小的字符串输出[J]. 佳木斯大学学报, 2001, 19(3): 243-245 |
| |
| 作者姓名： | 李大辉 苏桂贤 |
| |
| 作者单位： | [1]克山师范专科学校计算机系，黑龙江克山161600 [2]台州学院计算机系，浙江台州317000 |
| |
| 摘 要： | 通过求解字符串输出最小代价的问题，基于动态规划算法来讨论其解空间，进一步完成其最小代价的存在性、解空间的结构的定义及实现字符串输出的优化解的算法设计与分析。
|
| 关 键 词： | 代价 动态规划 字符串 字符串输出 优化解 复杂度 |
| 文章编号： | 1008-1402(2001)03-0243-03 |
REALIZATION OF OUTPUTTING CHARACTER STRING WITH SMALLEST COST BASED ON DYNAMIC PROGRAMMING ALGORITHM |
| |
| LI Da-hui ,SU Gui-xian. REALIZATION OF OUTPUTTING CHARACTER STRING WITH SMALLEST COST BASED ON DYNAMIC PROGRAMMING ALGORITHM[J]. Journal of Jiamusi University(Natural Science Edition), 2001, 19(3): 243-245 |
| |
| Authors: | LI Da-hui SU Gui-xian |
| |
| Affiliation: | LI Da-hui 1,SU Gui-xian 2 |
| |
| Abstract: | In the paper, an algorithm of smallest cost in character string outputting is proposed based on dynamic programming. The space structure of basic solution is studied first, and then dynamic programming is applied to define optimal substructure and the space structure of basic solution. At the end, the algorithm design and analysis are carried out. |
| |
| Keywords: | cost dynamic programming algorithms |
| 本文献已被 CNKI 维普 等数据库收录！ |
