Parallel Algorithms for Longest Common Subsequence Problem andAnt Colony Optimization Algorithms for Multiple-Longest Common Subsequence Problem
碩士 === 銘傳大學 === 資訊工程學系碩士班 === 92 === The longest common subsequence (LCS) problem has attracted many researchers’ attention since the ‘70s. Many sequential or parallel LCS algorithms can be found in the literature even since. We propose new parallel algorithms for the longest common subsequence (LCS...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/32537513777839733901 |