Longest Common Subsequence

Gives the longest common substring between two stings.

You are now following this Submission

%%%INPUT
%%%X, Y - both are strings e.g. 'test' or 'stingtocompare'
%%%OUTPUT
%%%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 (2026). Longest Common Subsequence (https://se.mathworks.com/matlabcentral/fileexchange/24559-longest-common-subsequence), MATLAB Central File Exchange. Retrieved .

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Version Published Release Notes Action
1.4.0.0

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

1.3.0.0

Included support for 0 similarity

1.2.0.0

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

1.1.0.0

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!

1.0.0.0