Longest Common Subsequence

Gives the longest common substring between two stings.

이 제출물을 팔로우합니다

%%%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)

인용 양식

David Cumin (2026). Longest Common Subsequence (https://kr.mathworks.com/matlabcentral/fileexchange/24559-longest-common-subsequence), MATLAB Central File Exchange. 검색 날짜: .

카테고리

Help CenterMATLAB Answers에서 Characters and Strings에 대해 자세히 알아보기

일반 정보

MATLAB 릴리스 호환 정보

  • 모든 릴리스와 호환

플랫폼 호환성

  • Windows
  • macOS
  • Linux
버전 퍼블리시됨 릴리스 정보 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