On the Set LCS and Set-Set LCS Problems

B.F. Wang; G.H. Chen; K. Park

doi:10.1006/jagm.1993.1025

Back

Journal article

Peer reviewed

On the Set LCS and Set-Set LCS Problems

B.F. Wang, G.H. Chen and K. Park

Journal of Algorithms, Vol.14(3), pp.466-477

05/1993

DOI: https://doi.org/10.1006/jagm.1993.1025

Abstract

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. All rights reserved.

Metrics

1 Record Views

Details

Title: On the Set LCS and Set-Set LCS Problems
Creators - without role: B.F. Wang - University College London
G.H. Chen - University College London
K. Park - University College London
Publication Details: Journal of Algorithms, Vol.14(3), pp.466-477
Identifiers: 9957767864106774
Academic Unit: Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: English
Resource Type: Journal article

On the Set LCS and Set-Set LCS Problems

Abstract

Related links

Metrics

Details

National Tsing Hua University Social media