How to find longest common substring in case of binary arrays?

Hello,my dear friends I need your assistance for solving a problem. I want to find longest common substring in case of two arrays with binary numbers. Let, x=[1 0 1 0], y= [0 1 1 0 1 1] then 1 0 1 of x are same in 1 0 1 of y in 3rd,4th,5th, positoin. So i need the perecentage of x are matching so here it is,75%,and also the index of y where it started matching ,in this case the starting index is 3.

Kindly help me in this regard.

[Stephen23]

Duplicate:

https://www.mathworks.com/matlabcentral/answers/329104-how-to-find-percentage-of-similarity-between-two-arrays