A Closer Look at the Closest String and Closest Substring Problem

DOI10.1137/1.9781611972917.2zbMath1430.68458OpenAlexW758637612MaRDI QIDQ5233693

Sebastian Böcker, Markus Chimani, Matthias Woste

Publication date: 12 September 2019

Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8966c504d2c50e55482a33c23250f178c1b54c1f

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (9)

Configurations and minority in the string consensus problem ⋮ An improved integer linear programming formulation for the closest 0-1 string problem ⋮ Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ Polynomial time approximation schemes for all 1-center problems on metric rational set similarities ⋮ LP-based heuristics for the distinguishing string and substring selection problems ⋮ Parameterized complexity analysis for the closest string with wildcards problem ⋮ Improved LP-based algorithms for the closest string problem ⋮ Heuristic approaches to the distinguishing substring selection problem ⋮ Unnamed Item

This page was built for publication: A Closer Look at the Closest String and Closest Substring Problem