Longest Common Subsequence from Fragments via Sparse Dynamic Programming

Brenda S. Baker, Raffaele Giancarlo. Longest Common Subsequence from Fragments via Sparse Dynamic Programming. In Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci, editors, Algorithms - ESA 98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings. Volume 1461 of Lecture Notes in Computer Science, pages 79-90, Springer, 1998. [doi]

Abstract

Abstract is missing.