位置：成果数据库 > 期刊 > 期刊详情页
A (1+epsilon)-approximation algorithm for sorting by short block-moves
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：2012.6.6
  • 页码：1-8
  • 相关项目：基因组比较问题的算法与复杂性
作者： Jiang Haitao|Zhu Daming|Zhu Binhai|
同期刊论文项目
基因组比较问题的算法与复杂性
期刊论文 14 会议论文 5 获奖 3
同项目期刊论文
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
A 14/11-approximation algorithm for sorting by short block-moves
Sorting genomes by generalized translocations
On the Toggling-Branching Recurrence of Computability Logic
An exact algorithm for the zero exemplar breakpoint distance problem
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
Protein-protein binding site identification by enumerating the configurations
Algorithms for sorting unsigned linear genomes by the DCJ operations
超椭圆曲线上Montgomery 标量乘的快速计算公式
最大不全k满足问题的局部搜索近似算法
超椭圆曲线上Montgomery标量乘的快速计算公式