Info
この質問は閉じられています。 編集または回答するには再度開いてください。
How to find longest common substring in case of binary arrays?
1 回表示 (過去 30 日間)
古いコメントを表示
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.
1 件のコメント
回答 (0 件)
参考
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!