求最长公共子序列长度的一个新方法.pdfVIP

福建农业大学学报 27(4) : 505 509, 1998 Jo rnal of F jian Agric lt ral University 求最长公共子序列长度的一个新方法 1 2 1 2 ( 福建农业大学基础部, 福建农业大学网络中心, 福州350002) X , X n, O(nlogn) , O(n) . X , Y . X m, Y n, O(m+ n) ; Y X , O( m+ nlogn) . , . ; ; TP301 A new algorithm f or f inding length of the longest common subsequence 1 2 Lin Qingbo W Ch ihong 1 2 ( Department of F ndamendal S bjects, FAU; Netw ork Center of FAU, F zho 350002) Abstract In t his paper, a new algorithm for finding t he longest monot onic s bseq ence of a string X was presented. T he new algorithm req ires O(nlogn) t ime and O(n) space if the length of the string X is n. By the new algorithm, the length of the longest common s bseq ence of st rings X and Y can be fo nd effectively and O(m+ n) space is req ired. If the elements of Y appears in X by constant n mber, the algorithm req ires O(m+ nlogn) tim e. As an application, the algorithm can be sed in com parison of text files and scoring the inp t text of an examinee. Key wordslongest monot onic s bseq ence; longest common s bseq ence; dynamic selecting tree ( ) , , , . 2 . . : 1, , , 1 , 0. . : A B 2, B A , B . , , . , O( m+ n) , O( m + nlogn) , ( mn ; , ( ) . A B O logn , ) ( 1998) . 收稿日期: 1998- 04- 30 林清波, 男, 1967年出生. 研究方向: 计算机程序设计及应用. 506 福建农业大学学报　1998年第27 卷 1 1.1 = 1, 2, , n , = 1, 2 , , k X x x x Z z z z X , Z , Z X . X , Z , Z X . : 2, 5, 3, 1, 4 2, 3, 4 1, 2, 3, 4, 5 . 1.2X ( ) : ( i) i , : { P x X x