Heuristic Algorithms for Finding the Longest Common Subsequence of Multiple Sequences
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 104 === Finding the Longest Common Subsequence of multiple sequences is an interesting and important problem in many areas, such as computer science and bioinformatics. Since its importance, some algorithms with about time complexity O(n^2) have been proposed for findi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/33501547738837837229 |