e/Longest common substring problem

Information
has gloss	eng: The longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings. It should not be confused with the longest common subsequence problem. (For an explanation of the difference between a substring and a subsequence, see Substring vs. subsequence).
lexicalization	eng: Longest common substring problem
lexicalization	eng: Longest-common substring problem
instance of	c/Algorithms on strings

Meaning
Russian
lexicalization	rus: Наибольшая общая подстрока

Media
media:img	Suffix tree ABAB BABA ABBA.svg