A new approximation algorithm for contig-based genomic scaffold filling

Guanlan Tan
Guanlan Tan
Xiangzhong Meng
Xiangzhong Meng

Theor. Comput. Sci., pp. 7-15, 2020.

Cited by: 0|Views2
EI

Abstract:

Abstract 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 lit...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments