Given an input of strings, return the longest common substring. Coding challenge from https://github.com/emfigo/lcs.
lein run "GCAAGTCTAATA" "CAAGGTTATATA" "GCAATTCTATAA" "CAATTGATATAA" "GCAATCATATAT"
Longest common substring(s): #{"CAA" "ATA"}
Copyright © 2016 FIXME
Distributed under the Eclipse Public License either version 1.0 or (at your option) any later version.