A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling

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 problem, called One-sided-GSF-max-BC problem. The previous approximation ratio for the problem is 2. However, as we pointed out in the introduction part, 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 an approximation algorithm of ratio 2.57 for the One-sided-GSF-max-BC problem. Our method is based on auxiliary graphs constructed and two applications of finding maximum matching in auxiliary graphs.

[1]  Jingjing Ma,et al.  Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling , 2016, FAW.

[2]  Boting Yang,et al.  Genomic Scaffold Filling Revisited , 2016, CPM.

[3]  Nan Liu,et al.  A Polynomial Time Solution for Permutation Scaffold Filling , 2016, COCOA.

[4]  Jingjing Ma,et al.  A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling , 2017, FAW.

[5]  Bin Fu,et al.  The Approximability of the Exemplar Breakpoint Distance Problem , 2006, AAIM.

[6]  Binhai Zhu,et al.  An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies , 2013, TCBB.

[7]  David Sankoff,et al.  Scaffold Filling under the Breakpoint and Related Distances , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[8]  David Sankoff,et al.  Scaffold filling, contig fusion and comparative gene order inference , 2010, BMC Bioinformatics.

[9]  Nan Liu,et al.  A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling , 2014, Algorithmica.

[10]  Richard Friedberg,et al.  Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..

[11]  Christian Komusiewicz,et al.  Beyond Adjacency Maximization: Scaffold Filling for New String Distances , 2017, CPM.

[12]  Bin Fu,et al.  Non-breaking Similarity of Genomes with Gene Repetitions , 2007, CPM.

[13]  Binhai Zhu,et al.  Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies , 2011, CPM.

[14]  Riccardo Dondi,et al.  Fixed-parameter algorithms for scaffold filling , 2015, Theor. Comput. Sci..

[15]  Binhai Zhu,et al.  Genomic Scaffold Filling: A Progress Report , 2016, FAW.