Computing the Number of Longest Common Subsequences

Abstract

This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.

3 pages, LaTeX

References in corpus (2)

• Fast and Simple Computation of All Longest Common Subsequences
• Bounds on the Number of Longest Common Subsequences