A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences
碩士 === 國立中山大學 === 資訊工程學系研究所 === 97 === The k-LCS problem is to find the longest common subsequence (LCS) of k input sequences. It is difficult while the number of input sequences is large. In the past, researchers focused on finding the LCS of two sequences (2-LCS). However, there is no good algorit...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/sxxy7c |