Finding a longest common subsequence between a run-length-encoded string and an uncompressed string☆
Under an Elsevier user license
open archive
Keywords
Longest common subsequence
Run-length encoding
String compression
Cited by (0)
- ☆
This work was supported in part by the National Science Council of the Republic of China under Contract NSC 95-2221-E260-025.
Copyright © 2007 Elsevier Inc. All rights reserved.