Application of the A* Algorithm to Solve the Longest Common Subsequence from Fragments Problem

• Main Authors: Yu-Mei Pan, 潘鈺梅
• Other Authors: Richard Chia-Tung Lee
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/39357694887108868886

碩士 === 國立暨南國際大學 === 資訊工程學系 === 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 discuss a variation of the LCS problem – LCS from fragments problem defined as follows: Given two strings X and Y and a set M of fragments which are matching substrings of X and Y, find a LCS from M. A new method using a tree searching strategy, A* algorithm, is proposed in this study for the LCS from fragments problem. The method can help us to filter out some fragments which wouldn’t appear in solutions, and efficiently find a solution. However, in worst cases, all fragments are needed to be computed in the solving process.