title: Suffix tree library for c++ with simple examples how to use it
body: <p>I'm searching for suffix tree library (that has linear time  construction), and all I found is PATL, but PATL has no documentation and I can't figure out any of the examples. 
  So is there a suffix tree library for c++ that has a decent documentation?</p>
  
  <p>PATL home :
  <a href="http://code.google.com/p/patl/" rel="nofollow">http://code.google.com/p/patl/</a></p>
  
  <p>EDIT:<br>
  Motivation: I need to process large amount of strings and find the frequent common substrings, and report if more than n occurrences of any substring occurred within t seconds. I implemented a tree (with counter in the nodes, actually it isn't a counter but an std::vector of visit times since like I said I need time), but it is very slow.
  So I thought of bulking up (concatenating with some random stuff between strings so that substrings don't span over more than one string) a certain amount of messages (let's say 30 seconds worth of data) and then build a suffix tree on that string. </p>