On the Hardness of Counting and Sampling Center Strings

被引：0
|
作者：
Boucher, Christina [1 ]
Omar, Mohamed [2 ]
机构：
[1] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
[2] Univ Calif, Dept Math, Davis, CA USA
来源：
STRING PROCESSING AND INFORMATION RETRIEVAL | 2010年 / 6393卷
关键词：
PRIMERS; DESIGN; GRAPHS; ALGORITHMS; PROGRAM;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given a set S of n strings, each of length P, and a non-negative value d, we define a center string as a string of length E that has Hamming distance at most d from each string in S. The #CLOSEST STRING problem aims to determine the number of unique center strings for a given set of strings S and input parameters n, l, and d. We show #CLOSEST STRING is impossible to solve exactly or even approximately in polynomial time, and that restricting #CLOSEST STRING so that any one of the parameters n, l, or d is fixed leads to an FPRAS. We show equivalent results for the problem of efficiently sampling center strings uniformly at random.
引用
收藏
页码：127 / +
页数：3
相关论文
共 50 条
  • [11] Counting strings in Dyck paths
    Sapounakis, A.
    Tasoulas, I.
    Tsikouras, P.
    DISCRETE MATHEMATICS, 2007, 307 (23) : 2909 - 2924
  • [12] Counting Dependent and Independent Strings
    Zimand, Marius
    FUNDAMENTA INFORMATICAE, 2014, 131 (3-4) : 485 - 497
  • [13] Hide and Mine in Strings: Hardness and Algorithms
    Bernardini, Giulia
    Conte, Alessio
    Gourdel, Garance
    Grossi, Roberto
    Loukides, Grigorios
    Pisanti, Nadia
    Pissis, Solon P.
    Punzi, Giulia
    Stougie, Leen
    Sweering, Michelle
    20TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2020), 2020, : 924 - 929
  • [14] Stringy instanton counting and topological strings
    Masahide Manabe
    Journal of High Energy Physics, 2015
  • [15] Stringy instanton counting and topological strings
    Manabe, Masahide
    JOURNAL OF HIGH ENERGY PHYSICS, 2015, (07):
  • [16] Hide and Mine in Strings: Hardness, Algorithms, and Experiments
    Bernardini, Giulia
    Conte, Alessio
    Gourdel, Garance
    Grossi, Roberto
    Loukides, Grigorios
    Pisanti, Nadia
    Pissis, Solon P.
    Punzi, Giulia
    Stougie, Leen
    Sweering, Michelle
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (06) : 5948 - 5963
  • [17] Counting strings with given elementary symmetric function evaluations - II: Circular strings
    Miers, CR
    Ruskey, F
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2004, 18 (01) : 71 - 82
  • [18] Lower bounds and the hardness of counting properties
    Hemaspaandra, LA
    Thakur, M
    THEORETICAL COMPUTER SCIENCE, 2004, 326 (1-3) : 1 - 28
  • [19] Lower bounds and the hardness of counting properties
    Hemaspaandra, LA
    Thakur, M
    FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 217 - 229
  • [20] On the hardness of counting problems of complete mappings
    Hsiang, J
    Hsu, DF
    Shieh, YP
    DISCRETE MATHEMATICS, 2004, 277 (1-3) : 87 - 100
12345