Add to ORKGThe prefix table of a string x = x[1..n] is an array π = π[1..n] such that π[i] is the length of the longest substring beginning at i that equals a prefix of x. In this paper we describe and evaluate algorithms for prefix table construction, some previously proposed, others designed by us. We also describe and evaluate new linear-time algorithms for transformations between π and the border array
AbstractThe suffix array is a data structure that finds numerous applications in string processing p...
We show that the Longest Common Prefix Array of a text collection of total size n on alphabet [1, σ]...
In 2003 three (-)(n)-time algorithms were proposed for the construction of a suffix array of a strin...
International audienceThe prefix table of a string x = x[1..n] is an array π = π[1..n] such that π[i...
International audienceFor some text algorithms, the real measure for the complexity analysis is not ...
International audienceThe Prefix table of a string reports for each position the maximal length of it...
The prefix table of a string is one of the most fundamental data structures of algorithms on strings...
An indeterminate string x=x[1..n] on an alphabet ΣΣ is a sequence of nonempty subsets of ΣΣ; x is...
International audienceFor some text algorithms, the real measure for the complexity analysis is not ...
Abstract. For some text algorithms, the real measure for the complexity analysis is not the string i...
A border of a string x is a proper (but possibly empty) prefix of x that is also a suffix of x. The ...
The suffix array, a space efficient alternative to the suffix tree, is an important data structure f...
U okviru ovog završnog rada obrađene su strukture podataka koje se često koriste u bioinformatici: s...
International audienceA substring of a string is unbordered if its only border is the empty string. ...
AbstractMany sequence analysis tasks can be accomplished with a suffix array, and several of them ad...
AbstractThe suffix array is a data structure that finds numerous applications in string processing p...
We show that the Longest Common Prefix Array of a text collection of total size n on alphabet [1, σ]...
In 2003 three (-)(n)-time algorithms were proposed for the construction of a suffix array of a strin...
International audienceThe prefix table of a string x = x[1..n] is an array π = π[1..n] such that π[i...
International audienceFor some text algorithms, the real measure for the complexity analysis is not ...
International audienceThe Prefix table of a string reports for each position the maximal length of it...
The prefix table of a string is one of the most fundamental data structures of algorithms on strings...
An indeterminate string x=x[1..n] on an alphabet ΣΣ is a sequence of nonempty subsets of ΣΣ; x is...
International audienceFor some text algorithms, the real measure for the complexity analysis is not ...
Abstract. For some text algorithms, the real measure for the complexity analysis is not the string i...
A border of a string x is a proper (but possibly empty) prefix of x that is also a suffix of x. The ...
The suffix array, a space efficient alternative to the suffix tree, is an important data structure f...
U okviru ovog završnog rada obrađene su strukture podataka koje se često koriste u bioinformatici: s...
International audienceA substring of a string is unbordered if its only border is the empty string. ...
AbstractMany sequence analysis tasks can be accomplished with a suffix array, and several of them ad...
AbstractThe suffix array is a data structure that finds numerous applications in string processing p...
We show that the Longest Common Prefix Array of a text collection of total size n on alphabet [1, σ]...
In 2003 three (-)(n)-time algorithms were proposed for the construction of a suffix array of a strin...