Designing and Implementing Algorithms for the Closest String Problem

DOI10.1007/978-3-319-59605-1_8zbMath1429.68341OpenAlexW2618556066MaRDI QIDQ4632205

Lusheng Wang, Shota Yuasa, Zhi-Zhong Chen, Bin Ma

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_8

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Randomized fixed-parameter algorithms for the closest string problem
• A three-string approach to the closest string problem
• On covering problems of codes
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Distinguishing string selection problems.
• More Efficient Algorithms for Closest String and Substring Problems
• Enumerating Neighbour and Closest Strings

This page was built for publication: Designing and Implementing Algorithms for the Closest String Problem