longest common substring problem
problem of finding the longest string that is a substring of two or more strings
Facts
2 properties- Instance of
- computational problem
- Different from
- longest common subsequence problem[2]
🏷️ Also known as
en longest common substring problem
ar أطول سلسلة فرعية مشتركة
cs hledání nejdelšího společného podslova
fa مساله بلندترین زیررشته مشترک
fa بزرگترین زیررشته مشترک
fa بزرگترین زیررشتهٔ مشترک
fa طولانی ترین زیررشته مشترک
fr plus longue sous-chaîne commune
pl Najdłuższy wspólny podłańcuch
ru Longest common substring
ru Наибольшая общая подстрока
uk найдовший спільний підрядок
vi Bài toán xâu con chung dài nhất
vi Bài toán xâu con chung lớn nhất
zh 最长公共子串
🔖 Identifiers · 4
- Dictionary of Algorithms and Data Structures ID
- LCS, longestCommonSubstring
- Freebase ID
- /m/06rw04
- Microsoft Academic ID (discontinued)
- 8555805
- Rosetta Code page ID
- Longest_common_substring
🔗 Connections
Different from 1
Instance of 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
longest common substring problem is a computational problem[1].