基于图形表示的LCS问题

LCS Problem Based on the Graphical Representation

所谓的LCS(Longest Common Subsequence)问题,就是寻找生物序列的最长公共子序列。传统的算法都是基于字符串的比较。近几年不少学者给出了生物序列的图形表示,本文就利用DNA序列的一种二维图形表示来寻找最长公共子序列。

LCS is the problem for finding a maximum common subsequence （Longest Common Subsequence） in biological sequence. The traditional method is based on comparison of string. Recently, many authors have provided graphical representations of biological sequences. Base on this idea, we provide a new method to solve the LCS in this paper.