{"paper":{"title":"Outlier Detection for DNA Fragment Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christina Boucher, Christine Lo, Daniel Lokshtanov","submitted_at":"2011-11-02T03:13:55Z","abstract_excerpt":"Given $n$ length-$\\ell$ strings $S =\\{s_1, ..., s_n\\}$ over a constant size alphabet $\\Sigma$ together with parameters $d$ and $k$, the objective in the {\\em Consensus String with Outliers} problem is to find a subset $S^*$ of $S$ of size $n-k$ and a string $s$ such that $\\sum_{s_i \\in S^*} d(s_i, s) \\leq d$. Here $d(x, y)$ denotes the Hamming distance between the two strings $x$ and $y$. We prove\n  1. a variant of {\\em Consensus String with Outliers} where the number of outliers $k$ is fixed and the objective is to minimize the total distance $\\sum_{s_i \\in S^*} d(s_i, s)$ admits a simple PTA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0376","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}