Parameterized complexity analysis for the Closest String with Wildcards problem
The Closest String problem asks to find a string s which is not too far from each string in a set of m input strings, where the distance is taken as the Hamming distance. This well-studied problem has various applications in computational biology and drug design. In this paper, we introduce a new va...
|Published in:||Theoretical computer science : the journal of the EATCS, Vol. 600 (2015), p. 11-18|
|Other Involved Persons:|
|QR Code:||Show QR Code|