title: Algorithm to find common substring across N strings
body: <p>I'm familiar with LCS algorithms for 2 strings. Looking for suggestions for finding common substrings in 2..N strings. There may be multiple common substrings in each pair. There can be different common substrings in subsets of the strings.</p>
  
  <p>strings: <code>(ABCDEFGHIJKL) (DEF) (ABCDEF) (BIJKL) (FGH)</code></p>
  
  <p>common strings:</p>
  
  <pre><code>1/2 (DEF)
  1/3 (ABCDEF)
  1/4 (IJKL)
  1/5 (FGH)
  2/3 (DEF)
  </code></pre>
  
  <p>longest common strings:</p>
  
  <pre><code>1/3 (ABCDEF)
  </code></pre>
  
  <p>most common strings:</p>
  
  <pre><code>1/2/3 (DEF)
  </code></pre>