go-lcss | Fast Longest Common Substring in Go

go-lcss is a Go library. go-lcss has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

Longest Common Substring (don't confuse with Longest Common Subsequence) is a well-known computer science problem of finding the longest substring which appears in all the given strings. It can be efficiently solved in log-linear time and linear space. The implemented algorithm uses the code to build suffix arrays which was copy-pasted from the Go's standard library - it is internal to index/suffixarray and unfortunately cannot be invoked directly. There is a blog post which gives some general understanding of that algorithm, though the actual implementation is quite different (and optimized).