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
相关论文
共 50 条
12345