Longest Common Substring Identification Task

A Longest Common Substring Identification Task is an string search task to identify a longest substring common to two item strings.

• Context:
  • output: longest common substring.
  • …
• Counter-Example(s):
  • Longest Common Subsequence Identification Task.
• See: Identification Task, Substring.

---

---

References

2011

• (Wikipedia, 2011) ⇒ http://en.wikipedia.org/wiki/Longest_common_substring_problem
  • 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).

---