A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet
碩士 === 國立中山大學 === 資訊工程學系研究所 === 105 === Given three sequences A, B and C with lengths of m, n and r, respectively, the constrained longest common subsequence (CLCS) problem is to fi nd the LCS of A and B which contains C as the subsequence of the answer. The dynamic program- ming (DP) for solving CL...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/488v4u |