Keywords

#longest_common_substring

Longest common substring

Computer science problem

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.

Wed 14th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Longest common substring Longest common subsequence Substring Suffix tree Gestalt pattern matching Subsequence Rope (data structure) Word n-gram language model Sequential pattern mining Nondeterministic finite automaton
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.