title: What are the differences between suffix links and failure links?
body: <p>I am studying algorithms in this semester and have read about the <a href="http://en.wikipedia.org/wiki/Aho%E2%80%93Corasick_string_matching_algorithm" rel="nofollow">Aho-Corasick string matching algorithm</a> and <a href="http://en.wikipedia.org/wiki/Ukkonen%27s_algorithm" rel="nofollow">Ukkonen's algorithm</a> for building suffix trees.</p>
  
  <p>I read both of them for but can't understand the main basic differences of these two, except that failure links check prefixes and suffix links check suffixes.</p>
  
  <p>What is the difference between these two algorithms?</p>