Danny Hermelin, Liat Rozenberg. Parameterized complexity analysis for the Closest String with Wildcards problem. Theoretical Computer Science, 600:11-18, 2015. [doi]
@article{HermelinR15,
title = {Parameterized complexity analysis for the Closest String with Wildcards problem},
author = {Danny Hermelin and Liat Rozenberg},
year = {2015},
doi = {10.1016/j.tcs.2015.06.043},
url = {http://dx.doi.org/10.1016/j.tcs.2015.06.043},
researchr = {https://researchr.org/publication/HermelinR15},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {600},
pages = {11-18},
}