Not checkedNot checked for notices yet.
<smcaps>Closest string with outliers</smcaps>
Ma Bin, Boucher Christina
BMC Bioinformatics · 2011
doi:10.1186/1471-2105-12-s1-s55 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
<p>Abstract</p> <p>Background</p> <p>Given <it>n</it> strings <it>s</it><sub>1</sub>, …, <it>s<sub>n</sub></it> each of length ℓ and a nonnegative integer <it>d</it>, the <smcaps>CLOSEST STRING</smcaps> problem asks to find a center string <it>s</it> such that none of the input strings has Hamming distance greater than <it>d</it> from <it>s</it>. Finding a common pattern in many – but not necessarily all – input strings is an important task that plays a role in many applications in bioinformatics.</p> <p>Results</p> <p>Although the closest string model is robust to the oversampling of strings in the input, it is severely affected by the existence of outliers. We propose a refined model, the <smcaps>CLOSEST STRING WITH OUTLIERS</smcaps> (CSWO) problem, to overcome this limitation. This new model asks for a center string <it>s</it> that is within Hamming distance <it>d</it> to at least <it>n – k</it> of the <it>n</it> input strings, where <it>k</it> is a parameter describing the maximum number of outliers. A CSWO solution not only provides the center string as a representative for the set of strings but also reveals the outliers of the set.</p> <p>We provide fixed parameter algorithms for CSWO when <it>d</it> and <it>k</it> are parameters, for both bounded and unbounded alphabets. We also show that when the alphabet is unbounded the problem is W[1]-hard with respect to <it>n – k</it>, ℓ, and <it>d</it>.</p> <p>Conclusions</p> <p>Our refined model abstractly models finding common patterns in several but not all input strings. We initialize the study of the computability of this model and show that it is sensitive to different parameterizations. Lastly, we conclude by suggesting several open problems which warrant further investigation.</p>
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.