Sparse Dynamic Programming for Longest Common Subsequence from Fragments
- 28 February 2002
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 42 (2) , 231-254
- https://doi.org/10.1006/jagm.2002.1214
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Parameterized Duplication in Strings: Algorithms and an Application to Software MaintenanceSIAM Journal on Computing, 1997
- Serial Computations of Levenshtein DistancesPublished by Oxford University Press (OUP) ,1997
- Sparse Dynamic Programming for Evolutionary-Tree ComparisonSIAM Journal on Computing, 1997
- String Editing and Longest Common SubsequencesPublished by Springer Nature ,1997
- Parameterized Pattern Matching: Algorithms and ApplicationsJournal of Computer and System Sciences, 1996
- Sparse dynamic programming IJournal of the ACM, 1992
- Sparse dynamic programming IIJournal of the ACM, 1992
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977