The Algorithms for the Linear Space S-table on the Longest CommonSubsequence Problem
碩士 === 國立中山大學 === 資訊工程學系研究所 === 106 === Given two sequences A and B of lengths m and n, respectively, the consecutive suffix alignment problem is to compute the longest common subsequence (LCS) between A and each suffix of B. The data structure for the consecutive suffix alignment problem is named S...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/3t4sv9 |