Add to ORKGInternational audienceGiven a string T of length n over an alphabet Σ ⊂ {1, 2,. .. , n O(1) } of size σ, we are to preprocess T so that given a range [i, j], we can return a representation of a shortest string over Σ that is absent in the fragment T [i] • • • T [j] of T. We present an O(n)-space data structure that answers such queries in constant time and can be constructed in O(n log σ n) time
Let be a string of length n and be the substring of starting at position i and ending at position j....
A word x that is absent from a word y is called minimal if all its proper factors occur in y. Given ...
International audienceAn absent (or forbidden) word of a word y is a word that does not occur in y. ...
Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so t...
Given a string T of length n over an alphabet Σ ⊂ {1, 2, . . . , nO(1)} of size σ, we are to preproc...
International audienceGiven a string T of length n over an alphabet Σ ⊂ {1, 2,. .. , n O(1) } of siz...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
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...
Abstract. Let D be a long input string of n characters (from an alphabet of size up to 2w, wherew is...
A string w is called a minimal absent word for another string T if w does not occur (as a substring)...
International audienceAn absent word of a word y of length n is a word that does not occur in y. It ...
WOS: 000347602000043We revisit the problem of finding shortest unique substring (SUS) proposed recen...
Let be a string of length n and be the substring of starting at position i and ending at position j....
A word x that is absent from a word y is called minimal if all its proper factors occur in y. Given ...
International audienceAn absent (or forbidden) word of a word y is a word that does not occur in y. ...
Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so t...
Given a string T of length n over an alphabet Σ ⊂ {1, 2, . . . , nO(1)} of size σ, we are to preproc...
International audienceGiven a string T of length n over an alphabet Σ ⊂ {1, 2,. .. , n O(1) } of siz...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
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...
Abstract. Let D be a long input string of n characters (from an alphabet of size up to 2w, wherew is...
A string w is called a minimal absent word for another string T if w does not occur (as a substring)...
International audienceAn absent word of a word y of length n is a word that does not occur in y. It ...
WOS: 000347602000043We revisit the problem of finding shortest unique substring (SUS) proposed recen...
Let be a string of length n and be the substring of starting at position i and ending at position j....
A word x that is absent from a word y is called minimal if all its proper factors occur in y. Given ...
International audienceAn absent (or forbidden) word of a word y is a word that does not occur in y. ...