The Longest Common Subsequence Problem in the Query-Answer Setting
碩士 === 國立暨南國際大學 === 資訊工程學系 === 99 === Given two sequences A = a1a2...am and B = b1b2...bn, the longest common subsequence problem is to find a subsequence such that the subsequence is a common subsequence of A and B and its length is longest. In this paper, we present a method for the longest common...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90726781275876037967 |