[seqfan] A094824 Maximum number of longest common substrings of two binary sequences of length n

Lars Blomberg lars.blomberg at visit.se
Sun Jun 15 18:50:20 CEST 2014


Hello,

I have trouble reproducing the terms.

The comments state:
“a(7) = 4 since the two strings 0001011 and 0011010 have as maximum length common substrings the 4 strings 011,001,101,010 and computer search shows that no other pair of strings of length 7 has more than 4 common maximum length substrings.”

But how about
0001100 and 0011000 which has 5 common substrings of length 4: 000 001 011 100 110 ?

What am I missing here?

Regards
Lars B



More information about the SeqFan mailing list