@edit-distance/myers-1986

Reasonably efficient and concise exact longest common subsequence and minimum edit-distance algorithm implementation for JavaScript

node-lcs

Implementations for the Longest Common Substring algorithm [O(nm) time]

common-path

Finds the longest common parent directory path in an array of file path strings or custom objects. Also returns sub and base parts for each path.