Finding the longest common subsequence from two strings is a well-known problem that was generally applied to diverse domains.Many related researches focus on reducing the computing time complexity.

• 摘要:找出两字串的最大共同子序列问题被广泛的应用在许多领域，有许多的研究皆是在探讨如何降低其计算上的复杂度。