You are not logged in. Please login at to post your questions!


Implementing suffix array

Given a string S[1....n] and l where l is an integer less than n then how can we efficiently construct the function f(n) (please see below for more explanation) for every string S[i,j] where j-i=l

f(n) denotes the longest longest suffix which is also the prefix of a string.

asked 26 Oct '14, 21:31

japoorv's gravatar image

accept rate: 0%

edited 26 Oct '14, 21:34

prefix of string S[1...N] or S[i,j] ??

(26 Oct '14, 21:50) neo1tech9_76★
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 26 Oct '14, 21:31

question was seen: 594 times

last updated: 26 Oct '14, 21:50