Abstract. Let D be a long input string of n characters (from an alphabet of size up to 2w, wherew is the number of bits in a machine word). Given a substring q of D, a shortest unique query returns a shortest unique substring of D that contains q. We present an optimal structure that consumes O(n) space, can be built in O(n) time, and answers a query in O(1) time. We also extend our techniques to solve several variants of the problem optimally.
This paper revisits the k-mismatch shortest unique substring finding problem and demonstrates that a...
Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so t...
International audienceGiven a string T of length n over an alphabet Σ ⊂ {1, 2,. .. , n O(1) } of siz...
WOS: 000347602000043We revisit the problem of finding shortest unique substring (SUS) proposed recen...
Let T[1, n] be a string of length n and T[i, j] be the substring of T starting at position i and end...
Let be a string of length n and be the substring of starting at position i and ending at position j....
Given a string X[1, n] and a position k ∈ [1, n], the Shortest Unique Substring of X covering k, den...
We consider the problem of answering shortest unique substring (SUS) queries on run-length encoded s...
Given a string X[1,n] and a position k∈[1,n], a Shortest Unique Substring of X covering k, denoted b...
A substring Q of a string S is called a shortest unique substring (SUS) for interval [s,t] in S, if ...
We revisit the problem of finding shortest unique substring (SUS) proposed recently by Pei et al. (I...
We consider the problem of encoding a string of length n from an integer alphabet of size so access,...
We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate ve...
Given a string X[1, n] and a position k in [1, n], the Shortest Unique Substring of X covering k, de...
This thesis deals with data structures that are mostly useful in the area of string matching and str...
This paper revisits the k-mismatch shortest unique substring finding problem and demonstrates that a...
Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so t...
International audienceGiven a string T of length n over an alphabet Σ ⊂ {1, 2,. .. , n O(1) } of siz...
WOS: 000347602000043We revisit the problem of finding shortest unique substring (SUS) proposed recen...
Let T[1, n] be a string of length n and T[i, j] be the substring of T starting at position i and end...
Let be a string of length n and be the substring of starting at position i and ending at position j....
Given a string X[1, n] and a position k ∈ [1, n], the Shortest Unique Substring of X covering k, den...
We consider the problem of answering shortest unique substring (SUS) queries on run-length encoded s...
Given a string X[1,n] and a position k∈[1,n], a Shortest Unique Substring of X covering k, denoted b...
A substring Q of a string S is called a shortest unique substring (SUS) for interval [s,t] in S, if ...
We revisit the problem of finding shortest unique substring (SUS) proposed recently by Pei et al. (I...
We consider the problem of encoding a string of length n from an integer alphabet of size so access,...
We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate ve...
Given a string X[1, n] and a position k in [1, n], the Shortest Unique Substring of X covering k, de...
This thesis deals with data structures that are mostly useful in the area of string matching and str...
This paper revisits the k-mismatch shortest unique substring finding problem and demonstrates that a...
Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so t...
International audienceGiven a string T of length n over an alphabet Σ ⊂ {1, 2,. .. , n O(1) } of siz...
Add to ORKG