Longest common substring
Computer science problem / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Longest common substring problem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.
Wikibooks has a book on the topic of: Algorithm Implementation/Strings/Longest common substring
Not to be confused with longest common subsequence.