Look what's there! utilizing the internet's existing data for censorship circumvention with OPPRESSION
An ongoing challenge in censorship circumvention is optimizing the stealthiness of
communications, enabled by covert channels. Recently, a new variant called history covert …
communications, enabled by covert channels. Recently, a new variant called history covert …
Constant-time edge label and leaf pointer maintenance on sliding suffix trees
Sliding suffix trees (Fiala & Greene, 1989) for an input text $ T $ over an alphabet of size
$\sigma $ and a sliding window $ W $ of $ T $ can be maintained in $ O (| T|\log\sigma) …
$\sigma $ and a sliding window $ W $ of $ T $ can be maintained in $ O (| T|\log\sigma) …
All-Pairs Suffix-Prefix on Dynamic Set of Strings
M Kikuchi, S Inenaga - International Symposium on String Processing and …, 2024 - Springer
The all-pairs suffix-prefix (APSP) problem is a classical problem in string processing which
has important applications in bioinformatics. Given a set S={S 1,…, S k} of k strings, the …
has important applications in bioinformatics. Given a set S={S 1,…, S k} of k strings, the …
Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems
L Leonard, K Tanaka - arxiv preprint arxiv:2203.16908, 2022 - arxiv.org
Given two strings $ T $ and $ S $ and a set of strings $ P $, for each string $ p\in P $,
consider the unique substrings of $ T $ that have $ p $ as their prefix and $ S $ as their …
consider the unique substrings of $ T $ that have $ p $ as their prefix and $ S $ as their …
Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings
S Inenaga - arxiv preprint arxiv:2005.00681, 2020 - arxiv.org
We deal with the problem of maintaining the suffix tree indexing structure for a fully-online
collection of multiple strings, where a new character can be prepended to any string in the …
collection of multiple strings, where a new character can be prepended to any string in the …