@article{2f202ba1f4b447518f3717f5904435b9, title = "Randomized Fixed-Parameter Algorithms for the Closest String Problem", abstract = "Given a set S = {s1, s2,…, sn} of strings of equal length L and an integer d, the closest string problem (CSP) requires the computation of a string s of length L such that d (s, si) ≤ d for each si ∈ S, where d (s, si) is the Hamming distance between s and si. The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms. Fixed-parameter algorithms provide the most practical solutions to its real-life applications in bioinformatics. In this paper we develop the first randomized fixed-parameter algorithms for CSP. Not only are the randomized algorithms much simpler than their deterministic counterparts, their time complexities are also significantly better than the previously best known (deterministic) algorithms.", keywords = "Computational biology, Fixed-parameter algorithms, Randomized algorithms, The closest string problem", author = "Zhi-Zhong Chen and Bin Ma and Lusheng Wang", year = "2016", month = jan, doi = "10.1007/s00453-014-9952-y", language = "English", volume = "74", pages = "466--484", journal = "Algorithmica", issn = "0178-4617", publisher = "Springer", number = "1", }