This question is closed. Reopen it to edit or answer.

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

1 view (last 30 days)
aditya sahu
aditya sahu on 10 Mar 2017
Closed: Stephen on 10 Mar 2017
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.

Answers (0)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!