Computing the Number of Longest Common Subsequences
<|reference_start|>Computing the Number of Longest Common Subsequences: 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.<|reference_end|>
@article{greenberg2003computing,
    title={Computing the Number of Longest Common Subsequences},
    author={Ronald I. Greenberg},
    journal={arXiv preprint arXiv:cs/0301034},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0301034},
    primaryClass={cs.DS cs.DM}
}