title: Most common subpath in a collection of paths
body: <p>There is numerous literature on the Web for the longest common subsequence problem but I have a slightly different problem and was wondering if anyone knows of a fast algorithm.</p>
  
  <p>Say, you have a collection of paths:</p>
  
  <p>[1,2,3,4,5,6,7], [2,3,4,9,10], [3,4,6,7], ...</p>
  
  <p>We see that subpath [3,4] is the most common.</p>
  
  <p>Know of a neat algorithm to find this? For my case there are tens of thousands of paths!</p>