论文信息 - Improved Approximability Result for Test Set with Small Redundancy

Improved Approximability Result for Test Set with Small Redundancy

Test set with redundancy is one of the focuses in recent bioin- formatics research. Set cover greedy algorithm (SGA for short) is a com- monly used algorithm for test set with redundancy. This paper proves that the approximation ratio of SGA can be (2 1 2r )ln n + 3 2 ln r + O(lnln n) by using the potential function technique. This result is better than the approximation ratio 2ln n which directly derives from set mul- ticover, when r = o( ln n ln ln n ), and is an extension of the approximability results for plain test set.

Peng Cui

[1] Neal E. Young,et al. Randomized rounding without solving the linear program , 1995, SODA '95.

[2] Kishori M. Konwar,et al. Highly scalable algorithms for robust string barcoding , 2005, Int. J. Bioinform. Res. Appl..

[3] R. Ravi,et al. Approximation algorithms for the test cover problem , 2003, Math. Program..

[4] Inge Li Gørtz,et al. Asymmetry in k-center variants , 2006, Theor. Comput. Sci..

[5] Ming-Yang Kao,et al. Tight Approximability Results for Test Set Problems in Bioinformatics , 2004, SWAT.

[6] Inge Li Gørtz,et al. Asymmetry in k-center variants , 2006, Theor. Comput. Sci..

[7] Vijay V. Vazirani,et al. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[8] Piotr Berman,et al. Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks , 2004, Discret. Appl. Math..

[9] Peng Cui. A Tighter Analysis of Set Cover Greedy Algorithm for Test Set , 2007, ESCAPE.

[10] B. Moret,et al. On Minimizing a Set of Tests , 1985 .

[11] Marek Chrobak,et al. Probe selection algorithms with applications in the analysis of microbial communities , 2001, ISMB.