On Chebyshev radius of a set in Hamming space and the closest string problem

The Chebyshev radius of a set in a metric space is defined to be the radius of the smallest ball containing the set. This quantity is closely related to the covering radius of the set and, in particular for Hamming set, is extensively studied in computational biology. This paper investigates some basic properties of radii of sets in n-dimensional Hamming space, provides a linear programing relaxation and gives tight bounds on the integrality gap. This results in a simple polynomial-time approximation algorithm that attains the performance of the best known such algorithms with shorter running time.

[1]  Dániel Marx,et al.  The closest substring problem with small distances , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[2]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[3]  Joseph S. B. Mitchell,et al.  Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions , 2003, ALENEX.

[4]  F. Bohnenblust,et al.  Convex Regions and Projections in Minkowski Spaces , 1938 .

[5]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[6]  Andrzej Lingas,et al.  Efficient approximation algorithms for the Hamming center problem , 1999, SODA '99.

[7]  Dennis Sylvester,et al.  Impact of small process geometries on microarchitectures in systems on a chip , 2001 .

[8]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[9]  Arya Mazumdar,et al.  The adversarial joint source-channel problem , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[10]  A. McLoughlin,et al.  The complexity of computing the covering radius of a code , 1984, IEEE Trans. Inf. Theory.

[11]  Hermann A. Maurer,et al.  New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.

[12]  Ami Litman,et al.  On covering problems of codes , 1997, Theory of Computing Systems.

[13]  Bin Ma,et al.  On the closest string and substring problems , 2002, JACM.

[14]  Bernd Gärtner,et al.  Fast Smallest-Enclosing-Ball Computation in High Dimensions , 2003, ESA.

[15]  Alexandr Andoni,et al.  On the Optimality of the Dimensionality Reduction Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[16]  Bin Ma,et al.  More Efficient Algorithms for Closest String and Substring Problems , 2008, SIAM J. Comput..

[17]  Joseph S. B. Mitchell,et al.  Approximate minimum enclosing balls in high dimensions using core-sets , 2003, ACM J. Exp. Algorithmics.

[18]  Jack Ritter,et al.  An efficient bounding sphere , 1990 .

[19]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[20]  Gábor Lugosi,et al.  Concentration Inequalities , 2008, COLT.

[21]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[22]  Piotr Indyk,et al.  Approximate clustering via core-sets , 2002, STOC '02.

[23]  Selmer M. Johnson.  A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.

[24]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[25]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.