TY - GEN

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

AU - Mazumdar, Arya

AU - Polyanskiy, Yury

AU - Saha, Barna

PY - 2013/12/19

Y1 - 2013/12/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84890350940&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890350940&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620457

DO - 10.1109/ISIT.2013.6620457

M3 - Conference contribution

AN - SCOPUS:84890350940

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1401

EP - 1405

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013

Y2 - 7 July 2013 through 12 July 2013

ER -