论文信息 - Study of the NP-completeness of the compact table problem

Study of the NP-completeness of the compact table problem

The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This problem is shown to be NP-complete in the general case, and some specific restrictions are studied.

Jean-Yves Moyen | Jean-Christophe Dubacq

[1] Reinhard Diestel,et al. Graph Theory , 1997 .

[2] Maciej Liskiewicz,et al. The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes , 2003, Theor. Comput. Sci..

[3] Clifford Stein,et al. A 2 2/3 Superstring Approximation Algorithm , 1998, Discret. Appl. Math..

[4] John E. Hopcroft,et al. Complexity of Computer Computations , 1974, IFIP Congress.

[5] Vincent Danjean,et al. On the use of haplotype phylogeny to detect disease susceptibility loci , 2005, BMC Genetics.

[6] David Maier,et al. On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..

[7] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..