An Improved Algorithm for the Longest Common Subsequence Problem
碩士 === 國立暨南國際大學 === 資訊工程學系 === 101 === The Longest Common Subsequence (LCS) problem is a well-known problem in the field of computer science. There are many variants and applications related to LCS such as computing the edit distance between two DNA sequences, automatic typing correction and even co...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/71921485917954092341 |