Efficient Algorithms for the Constrained Longest Common Subsequence Problems
博士 === 國立臺灣大學 === 資訊工程學研究所 === 98 === This dissertation studies several variants of the longest common subsequence (abbreviated LCS) problem. These variants arise from some applications and theoretical interests in molecular biology and sequence comparison. In the First part of this dissertation, w...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93278734584938381425 |