Also known as LCS
the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible
via Wikidata · CC0
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).