当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
A New Approximation Algorithm for Contig-based Genomic Scaffold Filling
Theoretical Computer Science ( IF 0.718 ) Pub Date : 2020-05-21 , DOI: 10.1016/j.tcs.2020.05.017
Guanlan Tan; Qilong Feng; Xiangzhong Meng; Jianxin Wang

Genomic Scaffold Filling problem forms an important class of problems, and has been paid lots of attention in the literature. In this paper, we study one of the Genomic Scaffold Filling problems, called One-sided-GSF-max-BC problem. The previous approximation ratio for the problem is 2. However, the ratio 2 algorithm in the literature can only deal with special instances of the problem, not really solve the One-sided-GSF-max-BC problem. In this paper, we give a new approximation algorithm for the problem. For any given instance of the One-sided-GSF-max-BC problem, auxiliary graphs are constructed based on the given instance and the relation between maximum matching in auxiliary graphs and optimal solution is studied, which results in an approximation algorithm with ratio 2.57.
更新日期:2020-05-21

 

全部期刊列表>>
Springer化学材料学
骄傲月
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
郭东升
汪铭
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug