Longest common substring

Wikibooks has a book on the topic of: Algorithm Implementation/Strings/Longest common substring
Not to be confused with longest common subsequence.

In computer science, a longest common substring of two or more strings is a longest string that is a substring of all of them. There may be more than one longest common substring. Applications include data deduplication and plagiarism detection.