{"paper":{"title":"Text Indexing and Searching in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, J. Ian Munro, Yakov Nekrich","submitted_at":"2017-12-20T11:51:51Z","abstract_excerpt":"We introduce the first index that can be built in $o(n)$ time for a text of length $n$, and can also be queried in $o(q)$ time for a pattern of length $q$. On an alphabet of size $\\sigma$, our index uses $O(n\\sqrt{\\log n\\log\\sigma})$ bits, is built in $O(n((\\log\\log n)^2+\\sqrt{\\log\\sigma})/\\sqrt{\\log_\\sigma n})$ deterministic time, and computes the number $\\mathrm{occ}$ of occurrences of the pattern in time $O(q/\\log_\\sigma n+\\log n)$. Each such occurrence can then be found in $O(\\sqrt{\\log n\\log\\sigma})$ time. By slightly increasing the space and construction time, to $O(n(\\sqrt{\\log n\\log\\si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07431","kind":"arxiv","version":3},"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"}