Computing the Number of Longest Common Subsequences
数据结构与算法
2007-05-23 v1 离散数学
摘要
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.
引用
@article{arxiv.cs/0301034,
title = {Computing the Number of Longest Common Subsequences},
author = {Ronald I. Greenberg},
journal= {arXiv preprint arXiv:cs/0301034},
year = {2007}
}
备注
3 pages, LaTeX