Parameterized complexity analysis for the Closest String with Wildcards problem

Danny Hermelin, Liat Rozenberg. Parameterized complexity analysis for the Closest String with Wildcards problem. Theoretical Computer Science, 600:11-18, 2015. [doi]

Abstract

Abstract is missing.