Exact Solutions for Closest String and Related Problems-Reference-Cited by-同舟云学术

Exact Solutions for Closest String and Related Problems

Published:2001 Issue: Volume: Page:441-453
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Gramm Jens,Niedermeier Rolf,Rossmanith Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45678-3_38

Reference12 articles.

1. J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229(1–3):3–27, 2001.

2. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer. 1999.

3. P. A. Evans and H. T. Wareham. Practical non-polynomial time algorithms for designing universal DNA oligonucleotides: a systematic approach. Manuscript, April 2001.

4. M. Frances and A. Litman. On covering problems of codes. Theory of Computing Systems, 30:113–119, 1997.

5. R. Kannan. Minkowski’s convex body theorem and integer programming. Mathematics of Operations Research, 12:415–440, 1987.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New Modeling Ideas for the Exact Solution of the Closest String Problem;Communications in Computer and Information Science;2018

2. Consensus String Problem for Multiple Regular Languages;Language and Automata Theory and Applications;2017

3. Configurations and Minority in the String Consensus Problem;Algorithmica;2015-04-17

4. On the Kernelization Complexity of String Problems;Lecture Notes in Computer Science;2014

5. On the Efficiency of the Hamming C-Centerstring Problems;Combinatorial Pattern Matching;2014