Longest Common Subsequence

Gives the longest common substring between two stings.
Updated 27 Jul 2011

View License

%%%X, Y - both are strings e.g. 'test' or 'stingtocompare'
%%%D is the substring over the length of the shortest string
%%%dist is the length of the substring
%%%aLongestString is a sting of length dist (only one of potentially many)

Cite As

David Cumin (2024). Longest Common Subsequence (https://www.mathworks.com/matlabcentral/fileexchange/24559-longest-common-subsequence), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2006b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Find more on Characters and Strings in Help Center and MATLAB Answers

Community Treasure Hunt

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

Start Hunting!
Version Published Release Notes

Changed the title to better represent the function. http://en.wikipedia.org/wiki/Longest_common_subsequence_problem

Included support for 0 similarity

Now will also work for integer inputs (not only strings).

Sorry - a simple operator change fixed that. Should work now. The answer to your 'test' 'stingtocompare' is [0.5 2 'st'].
Thanks for pointing out the error!