Computing the Number of Longest Common Subsequences

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Data Structures and Algorithms, Discrete Mathematics, F.2.2; G.2.1

Citation

URI

https://dspace.dare.co.zw/handle/123456789/42648

Collections

arXiv

Endorsement

Review

Supplemented By

Referenced By