Which algorithm to use to find all common substring (LCS case) with really big strings
I came across this problem before. I compressed the strings and applied dynamic programming on the compressed strings. 

For compression techniques, I followed the methods described in this paper: 
http://pdf.aminer.org/000/145/966/data_compression_using_long_common_strings.pdf

The speed was decent. But, it consumed some space though.