{"paper":{"title":"Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dany Breslauer, Diptarama Hendrian, Hiroki Arimura, Shunsuke Inenaga, Takuya Takagi","submitted_at":"2015-07-28T02:15:02Z","abstract_excerpt":"We consider construction of the suffix tree and the directed acyclic word graph (DAWG) indexing data structures for a collection $\\mathcal{T}$ of texts, where a new symbol may be appended to any text in $\\mathcal{T} = \\{T_1, \\ldots, T_K\\}$, at any time. This fully-online scenario, which arises in dynamically indexing multi-sensor data, is a natural generalization of the long solved semi-online text indexing problem, where texts $T_1, \\ldots, T_{k}$ are permanently fixed before the next text $T_{k+1}$ is processed for each $1 \\leq k < K$. We present fully-online algorithms that construct the su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07622","kind":"arxiv","version":5},"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"}