Longest Common Subsequence with Constraints
碩士 === 國立暨南國際大學 === 資訊工程學系 === 94 === In this thesis, we address the constrained longest common subsequence problem which is defined as follows. Given two sequences X and Y, and a constrained sequence Z, find a longest common subsequence P of X and Y such that Z is a subsequence of P. Recently, Chin...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/11476388524332509595 |