A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Parameterized Intractability of Distinguishing Substring Selection
2004
Theory of Computing Systems
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-complete Distinguishing Substring Selection problem (DSSS for short) which asks, given a set of "good" strings and a set of "bad" strings, for a solution string which is, with respect to Hamming metric, "away" from the good strings and "close" to the bad strings. More precisely, given integers d g , d b , and L, we ask for a
doi:10.1007/s00224-004-1185-z
fatcat:n2jdzmlmarastelx4frzhr4s3y