| 一类基因组断点median问题的模型与算法 |
| |
| 引用本文： | 王继强. 一类基因组断点median问题的模型与算法[J]. 科学技术与工程, 2012, 12(14): 3315-3318 |
| |
| 作者姓名： | 王继强 |
| |
| 作者单位： | 山东财经大学数学与数量经济学院,济南,250014 |
| |
| 基金项目： | 国家自然科学基金项目(10901093). |
| |
| 摘 要： | 研究了来自生物信息学领域的基因组断点median问题。在无向环形基因组的经典情形的基础上,针对有向环形基因组的情形给出了模型和算法。基于LINGO软件的算例表明算法是可行和有效的。
|
| 关 键 词： | 断点 median 算法 相邻度 标准增广 旅行商问题 |
| 收稿时间： | 2012-02-23 |
| 修稿时间： | 2012-02-23 |
The Model and Algorithm for a Kind of Genome Breakpoint Median Problem |
| |
| Wang Jiqiang. The Model and Algorithm for a Kind of Genome Breakpoint Median Problem[J]. Science Technology and Engineering, 2012, 12(14): 3315-3318 |
| |
| Authors: | Wang Jiqiang |
| |
| Affiliation: | WANG Ji-qiang (School of Mathematics and Quantitative Economics,Shandong University of Finance and Economics,Jinan 250014,P.R.China) |
| |
| Abstract: | The genome breakpoint median problem, arising in the area of bioinformatics, is studied. Based on the classic case of this problem, for the case of where directed and circular genomes are involved, a model is formulated and an algorithm is proposed. A numerical instance based on LINGO software shows that the algorithm is feasible and efficient. |
| |
| Keywords: | Breakpoint median algorithm adjacency standard augmentation traveling salesman problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
|
点击此处可从《科学技术与工程》下载全文 |
