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: | Chia-Wei Yeh, 葉佳韋 |
---|---|
Other Authors: | 趙坤茂 |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/33501547738837837229 |
Similar Items
-
A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences
by: Chung-Han Chiang, et al.
Published: (2009) -
A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences
by: Hsiang-yi Weng, et al.
Published: (2009) -
Array Algorithms for Finding All Longest Common Subsequences
by: Lai I Lin, et al.
Published: (1993) -
Parallel Algorithms for Longest Common Subsequence Problem and Ant Colony Optimization Algorithms for Multiple-Longest Common Subsequence Problem
by: 陳則輔
Published: (2004) -
New systolic algorithms for solving the longest common subsequence problem
by: Yeh Jih-Wei, et al.
Published: (1998)