Finding Constrained Longest Common Subsequences between Two Run-Length Encoded Strings
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === In this paper, we shall discuss how to solve the constrained longest common subsequence (CLCS) problem between two Run-length encoded strings. Given two run-length encoded strings X and Y and a constrained sequence P, a sequence Z is a constrained longest common...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83740585370567837281 |
| Summary: | 碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === In this paper, we shall discuss how to solve the constrained longest common subsequence (CLCS) problem between two Run-length encoded strings. Given two run-length encoded strings X and Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is a longest sequence of X and Y such that P is a subsequence of Z. We shall propose an efficient algorithm to solve the CLCS problem. The time complexity of our algorithm is O [ r (mN + Mn – mn) + S ], where string X has M characters and m runs, string Y has N characters and n runs and P has r characters and S are grids without calculating of Xi = Yj = Pk block.
|
|---|