title: Suffix tree vs Suffix array for LCS
body: <p>I'm working on a program to find the longest common substring between multiple strings. I've lowered my approach down to either using suffix array's or a suffix tree. I want to see which is the better approach (if there is one) and why. Also for suffix array's I've seen a few algorithms for two strings but not any for more then two strings. Any solid examples would be appreciated, thanks again for the advice!</p>
  
  <p>Note: I didn't see any other questions that specifically addressed this issue, but if they exist please point me in that direction!</p>