suffix-array

Suppose I constructed a suffix array, i.e. an array of integers giving the starting positions of all suffixes of a string in lexicographical order. Example: For a string str=abcabbca , the suffix array is: suffixArray[] = [7 3 0 4 5 1 6 2] Explanation: i Suffix LCP of str and str[i..] Length of LCP 7 a a 1 3 abbca ab 2 0 abcabbca abcabbca 8 4 bbca empty string 0 5 bca empty string 0 1 bcabbca empty string 0 6 ca empty string 0 2 cabbca empty string 0 Now with this suffixArray constructed, I want to find the length of the Longest Common Prefix (LCP) between str (the string itself) and each of

I need to find the longest common substring of n strings and use the result in my project. Is there any existing implementation/library in java which already does this? Thanks for your replies in advance. What about concurrent-trees ? It is a small (~100 KB) library available in Maven Central . The algorithm uses combination of Radix and Suffix Trees . Which is known to have a linear time complexity ( wikipedia ). public static String getLongestCommonSubstring(Collection<String> strings) { LCSubstringSolver solver = new LCSubstringSolver(new DefaultCharSequenceNodeFactory()); for (String s:

Can someone explain how this code for constructing the LCP from a suffix array works? suffixArr[] is an array such that suffixArr[i] holds the value of the index in the string for the suffix with rank i . void LCPconstruct() { int i,C[1001],l; C[suffixArr[0]] = n; for(i=1;i<n;i++) C[suffixArr[i]] = suffixArr[i-1]; l = 0; for(i=0;i<n;i++) { if(C[i]==n) LCPadj[i] = 0; else { while(i+l<n && C[i]+l<n && s[i+l] == s[C[i]+l]) l++; LCPadj[i] = l; l = max(l-1,0); } } for(i=0;i<n;i++) cout<<LCPadj[suffixArr[i]]<<"\n"; } First, it's important to realize that the algorithm processes the suffixes in the

I need to find the longest non-overlapping repeated substring in a String. I have the suffix tree and suffix array of the string available. When overlapping is allowed, the answer is trivial (deepest parent node in suffix tree). For example for String = "acaca" If overlapping is allowed, the answer is "aca" but when overlapping is not allowed, the answer is "ac" or "ca". I need the algorithm or high level idea only. P.S.: I tried but there is no clear answer I can find on web. Generate suffix array and sort in O(nlogn).ps: There is more effective algorithm like DC3 and Ukkonen algorithm.

Foreword: My question is mainly an algorithmic question, so even if you are not familiar with suffix and LCP arrays you can probably help me. In this paper it is described how to efficiently use suffix and LCP arrays for string pattern matching. I understood SA and LCP work and how the algorithm's runtime can be improved from O(P*log(N)) (where P is the length of the pattern and N is length of the string) to O(P+log(N)) (Thanks to Chris Eelmaa's answer here and jogojapans answer here ). I was trying to go through the algorithm in figure 4 which explains the usage of LLcp and RLcp . But I have

Consider a string of length n (1 <= n <= 100000). Determine its minimum lexicographic rotation. For example, the rotations of the string “alabala” are: alabala labalaa abalaal balaala alaalab laalaba aalabal and the smallest among them is “aalabal”. This is the problem from ACM ICPC 2003 .This problem has already been asked in stack flow by some other user.[But that wasn't useful as , I want to do it by suffix Array.] How to do this problem using the Suffix Array? Till Now what I had done?? (1) Lets say the given string is S. I concatenated the string S with itself to get a string S'. ie. S'=S

A suffix array will index all the suffixes for a given list of strings, but what if you're trying to index all the possible unique substrings? I'm a bit new at this, so here's an example of what I mean: Given the string abcd A suffix array indexes (at least to my understanding) (abcd,bcd,cd,d) I would like to index (all the substrings) (abcd,bcd,cd,d,abc,bc,c,ab,b,a) Is a suffix array what I'm looking for? If so, what do I do to get all the substrings indexed? If not, where should I be looking? Also what would I google for to contrast "all substrings" vs "suffix substrings"? The suffix array