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.Comment: 3 pages, LaTe

Greenberg, Ronald I.

English

arXiv

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

Computing the Number of Longest Common Subsequences

Abstract

Similar works

Full text

Available Versions

Name not available

Loyola eCommons