PROBING THE HARDNESS OF THE APPROXIMATE GENE CLUSTER DISCOVERY PROBLEM (AGCDP)

被引：0
|
作者：
Cabunducan, G. S. [1 ]
Clemente, J. B. [1 ]
Adorna, H. N. [1 ]
Relator, R. T. [2 ]
机构：
[1] Univ Philippines, Dept Comp Sci, Algorithms & Complex Lab, Quezon City 1101, Philippines
[2] Univ Philippines, Inst Math, Quezon City 1101, Philippines
来源：
Theory and Practice of Computation | 2015年
关键词：
Approximate Gene Cluster Discovery Problem; Median String Problem; Reduction; NP-hard;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present a polynomial-time transformation of the input for a variant of Median String Problem (MSP) that employs Hamming distance into the input for Approximate Gene Cluster Discovery Problem (AGCDP). Since MSP is NP-complete, the transformation forms the integral part of the reduction of MSP into AGCDP, for all input instances, such that AGCDP is confirmed to be NP-hard.
引用
收藏
页码：35 / 48
页数：14
相关论文
共 50 条
  • [1] From Approximate Clausal Reasoning to Problem Hardness
    Rajaratnam, David
    Pagnucco, Maurice
    AI 2011: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2011, 7106 : 501 - 510
  • [2] Hardness of and approximate mechanism design for the bike rebalancing problem
    Lv, Hongtao
    Wu, Fan
    Luo, Tie
    Gao, Xiaofeng
    Chen, Guihai
    THEORETICAL COMPUTER SCIENCE, 2020, 803 : 105 - 115
  • [3] Probing the elastic modulus and hardness of superionic boron cluster solid electrolytes
    Hempel, Jacob L.
    Thapa, Santosh
    Kim, Kwangnam
    Kweon, Kyoung E.
    Wood, Brandon C.
    Sevryugina, Yulia, V
    Mohtadi, Rana
    Tutusaus, Oscar
    Cheng, Yang-Tse
    JOURNAL OF POWER SOURCES, 2025, 641
  • [4] NP-hardness of the cluster minimization problem revisited
    Adib, AB
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2005, 38 (40): : 8487 - 8492
  • [5] Approximate Solutions to the Nonlinear Boundary Problem on Polaron in a Cluster
    Ustinin, M. N.
    Bulletin of the Russian Academy of Sciences. Physics, 1996, 60 (09)
  • [6] Addressing the Hardness of k-Facility Relocation Problem: A Pair of Approximate Solutions
    Wang, Hu
    Li, Hui
    Wang, Meng
    Cui, Jiangtao
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 1919 - 1928
  • [7] Discovery of a Widely Distributed Antibiotic Biosynthesis Gene Cluster
    Mitchell, Douglas A.
    Lee, Shaun
    Markley, Andrew L.
    Hensler, Mary E.
    Dixon, Jack E.
    FASEB JOURNAL, 2008, 22
  • [8] TOUCAN: a framework for fungal biosynthetic gene cluster discovery
    Almeida, Hayda
    Palys, Sylvester
    Tsang, Adrian
    Diallo, Abdoulaye Banire
    NAR GENOMICS AND BIOINFORMATICS, 2020, 2 (04)
  • [9] Discovery of the lomaiviticin biosynthetic gene cluster in Salinispora pacifica
    Janso, Jeffrey E.
    Haltli, Brad A.
    Eustaquio, Alessandra S.
    Kulowski, Kerry
    Waldman, Abraham J.
    Zha, Li
    Nakamura, Hitomi
    Bernan, Valerie S.
    He, Haiyin
    Carter, Guy T.
    Koehn, Frank E.
    Balskus, Emily P.
    TETRAHEDRON, 2014, 70 (27-28) : 4156 - 4164
  • [10] Discovery of a widely distributed toxin biosynthetic gene cluster
    Lee, Shaun W.
    Mitchell, Douglas A.
    Markley, Andrew L.
    Hensler, Mary E.
    Gonzalez, David
    Wohlrab, Aaron
    Dorrestein, Pieter C.
    Nizet, Victor
    Dixon, Jack E.
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2008, 105 (15) : 5879 - 5884
12345