Efficient Algorithms for some Heaviest Subsequence Problems
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 95 === We study some variants of the longest common subsequence (LCS) and the longest increasing subsequence (LIS) problems. In computational biology, some researches have shown that there are some relationships between two common genes from two or more different genom...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/05312962513226368731 |