ON THE SET LCS AND SET SET LCS PROBLEMS

被引：2

作者：

WANG, BF

CHEN, GH

PARK, K

机构：

[1] NATL TAIWAN UNIV,DEPT COMP SCI & INFORMAT ENGN,TAIPEI,TAIWAN

[2] UNIV LONDON KINGS COLL,DEPT COMP,LONDON WC2R 2LS,ENGLAND

来源：

JOURNAL OF ALGORITHMS | 1993年 / 14卷 / 03期

关键词：

D O I：

10.1006/jagm.1993.1025

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider two generalizations of the longest common subsequence (LCS) problem: the Set LCS problem and the Set-Set LCS problem. We present algorithms for the two problems that are faster than the previous ones by Hirschberg and Larmore. © 1993 Academic Press, Inc.

引用

页码：466 / 477

页数：12

共 8 条

[1] Aho Alfred V., 1974, DESIGN ANAL COMPUTER
[2] BLOCH JJ, 1985, 1985 P INT COMP MUS
[3] THE SET-SET LCS PROBLEM
HIRSCHBERG, DS
LARMORE, LL
[J]. ALGORITHMICA, 1989, 4 (04) : 503 - 510
[4] THE SET LCS PROBLEM
HIRSCHBERG, DS
LARMORE, LL
[J]. ALGORITHMICA, 1987, 2 (01) : 91 - 95
[5] HUANG SHS, 1989, COMPUTING AND INFORMATION, P81
[6] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES
HUNT, JW
SZYMANSKI, TG
[J]. COMMUNICATIONS OF THE ACM, 1977, 20 (05) : 350 - 353
[7] WORST-CASE ANALYSIS OF SET UNION ALGORITHMS
TARJAN, RE
VANLEEUWEN, J
[J]. JOURNAL OF THE ACM, 1984, 31 (02) : 245 - 281
[8] Tarjan RE, 1983, DATA STRUCTURES NETW

← 1 →