Title

Computing the Number of Longest Common Subsequences

Document Type

Technical Report

Publication Date

1-2003

Publication Title

Computer Science Research Repository

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.

Identifier

arXiv:cs/0301034

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.