Questions tagged [longest-substring]

The longest common substring problem is a derivative of the edit distance problem, which focuses on the most common typing errors:

• namely character omissions
• insertions
• substitutions
• reversals

The idea is to compute the minimum number of operations that it would take to transform one string into another. The longest common substring problem follows with the following constraints:

• substitutions are forbidden
• only exact character match, insert, and delete are allowable edit operations

References

• Dictionary of Algorithms and Data Structures: longest common substring

• Algorithm implementation/Strings/Longest common substring)

• Softpanorama: Algorithms and Data Structures - Longest Common Substring Problem

• Similarity Ranking Methods: Longest Common Substring