The set-set LCS problem
- 1 June 1989
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 4 (1) , 503-510
- https://doi.org/10.1007/bf01553904
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The set LCS problemAlgorithmica, 1987
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975