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
Recommended Citation
Ronald I. Greenberg. Computing the number of longest common subsequences. Technical report, Computer Science Research Repository (http://arXiv.org), 2003. Article ID cs/0301034v1.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
COinS
Comments
© 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.