return [s[i:i + width] for i in range(len(s) - width + 1)]
l = ['ATTGCGGCTCACGAA', 'ACCTAGATACGACGG', 'CCCCTGTCCATGGTA']
python counting number of presence and absence of substrings in list of sequences