Papers › Space-Efficient Indexes for Uncertain Strings
Space-Efficient Indexes for Uncertain Strings
Esteban Gabory, Chang Liu, Grigorios Loukides, Solon P. Pissis, Wiktor Zuba
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Strings in the real world are often encoded with some level of uncertainty. In the character-level uncertainty model, an uncertain string X of length n on an alphabet Σ is a sequence of n probability distributions over Σ. Given an uncertain string X and a weight threshold 1/z∈(0,1], we say that pattern P occurs in X at position i, if the product of probabilities of the letters of P at positions i,…,i+|P|-1 is at least 1/z. While indexing standard strings for online pattern searches can be performed in linear time and space, indexing uncertain strings is much more challenging. Specifically, the state-of-the-art index for uncertain strings has 𝒪(nz) size, requires 𝒪(nz) time and 𝒪(nz) space to be constructed, and answers pattern matching queries in the optimal 𝒪(m+|Occ|) time, where m is the length of P and |Occ| is the total number of occurrences of P in X. For large n and (moderate) z values, this index is completely impractical to construct, which outweighs the benefit of the supported optimal pattern matching queries. We were thus motivated to design a space-efficient index at the expense of slower yet competitive pattern matching queries. We propose an index of 𝒪(nz/ℓlogz) expected size, which can be constructed using 𝒪(nz/ℓlogz) expected space, and supports very fast pattern matching queries in expectation, for patterns of length m≥ℓ. We have implemented and evaluated several versions of our index. The best-performing version of our index is up to two orders of magnitude smaller than the state of the art in terms of both index size and construction space, while offering faster or very competitive query and construction times.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections