{"paper":{"title":"A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.DS","authors_text":"Hieu Dinh, Sanguthevar Rajasekaran","submitted_at":"2010-09-21T02:39:34Z","abstract_excerpt":"An exact-match overlap graph of $n$ given strings of length $\\ell$ is an edge-weighted graph in which each vertex is associated with a string and there is an edge $(x,y)$ of weight $\\omega = \\ell - |ov_{max}(x,y)|$ if and only if $\\omega \\leq \\lambda$, where $|ov_{max}(x,y)|$ is the length of $ov_{max}(x,y)$ and $\\lambda$ is a given threshold. In this paper, we show that the exact-match overlap graphs can be represented by a compact data structure that can be stored using at most $(2\\lambda -1 )(2\\lceil\\log n\\rceil + \\lceil\\log\\lambda\\rceil)n$ bits with a guarantee that the basic operation of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3984","kind":"arxiv","version":1},"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"}