Application of the A* Algorithm to Solve the Longest Common Subsequence from Fragments Problem
碩士 === 國立暨南國際大學 === 資訊工程學系 === 93 === Finding longest common subsequence (LCS) is a common problem in Biology informatics. The problem is defined as follows: Given two strings X=x1x2…xm and Y=y1y2…yn, find a common subsequence L=l1l2…lp of X and Y such that p is maximized. In this thesis, we disc...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39357694887108868886 |