• Of two or more strings, the longest string that is a substring of all of them. There may be more than one longest common substring. For example, the strings “ABABC”, “BABCA”, and “ABCBA” have only one longest common substring, “ABC” of length 3; other common substrings are “A”, “AB”, “B”, “BA”, “BC”, and “C”. Applications for longest common substrings include data deduplication and plagiarism detection. ← Wikipedia

1. Related terms: Critical path
2. Previous term: longdesc
3. Next term: Look and feel
4. Random term: 424 (webglossary.info/random 🎲)