title: Algorithm to identifying all the common subsequences in two strings
body: <p>I need to identify all the sub-sequences of given two strings. Longest common sub-sequence will only identify the longest one. But here I want all sub sequences exceeding a threshold value. Any specific algorithm or approach ?</p>
  
  <p>Something like this</p>
  
  <pre><code>Julie loves me more than Linda loves me
  Jane likes me more than Julie loves me
  </code></pre>
  
  <p>if the threshold value is 2, the following are the common sub-sequences of these 2 strings</p>
  
  <pre><code>me more than
  loves me
  </code></pre>