|
|||||
|
|
| 环型二元序列的赋权对换排序问题 | |
| 引用本文： | 亓兴勤,曹静,张晨.环型二元序列的赋权对换排序问题[J].山东大学学报(理学版),2007,42(12):46-48. |
| 作者姓名： | 亓兴勤 曹静 张晨 |
| 作者单位： | 1. 山东大学威海分校,数学系,山东,威海,264209 2. 燕山大学,理学院,河北,秦皇岛,066004 3. 山东大学威海分校,国有资产管理处,山东,威海,264209 |
| 基金项目： | 山东大学威海分校科研启动基金 |
| 摘 要： | 研究了环型二元序列的赋权对换排序问题。定义一个长度为l的对换的费用是f(l)=lα,0≤α<1,对环型二元序列的赋权对换排序问题给出了一个O(logn)近似算法,其中n是环型二元序列的长度。 |
| 关 键 词： | 环型二元序列 对换 近似算法 |
| 文章编号： | 1671-9352（2007）12-0046-03 |
| 收稿时间： | 2007-06-13 |
| 修稿时间： | 2007年6月13日 |
Sorting circular binary strings with length weighted transpositions |
|
| QI Xing-qin,CAO Jing,ZHANG Chen.Sorting circular binary strings with length weighted transpositions[J].Journal of Shandong University,2007,42(12):46-48. | |
| Authors: | QI Xing-qin CAO Jing ZHANG Chen |
| Institution: | 1. Department of Mathematics, Shandong University at Weihai, Weihai264209;2. College of Science, Yanshan University, Qinhuangdao 066004;3. State Owned Assets Supervision and Administration Faculty, Shandong Univerisity at Weihai |
| Abstract: | The problem of sorting circular binary strings with length-weighted transpositions was considered, i.e. the cost of a transposition is f(l)=lα,0≤α<1, where l is the length of the transposition. An O(logn)approximation algorithm is given for sorting a circular binary string with the minimum cost, where n is the length of the circular string. The result has direct applications in computational biology in the field of comparative genomics. |
| Keywords: | circular binary string transposition approximation algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ | |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 | |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 | |