Matching for run-length encoded strings

Journal of Complexity

Volumn 15, Issue 1, 1999, Pages 4-16

  Apostolico, Alberto ^a,b   Landau, Gad M ^c,d   Skiena, Steven ^e  

^a Purdue University   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

^c POLYTECHNIC UNIVERSITY   (United States)

^d UNIVERSITY OF HAIFA   (Israel)

^e Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005868515     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1998.0493     Document Type: Article

References (10)

1. Aho A. V., Hirschberg D. S., Ullman J. D. Bounds on the complexity of the longest common subsequence problem. J. Assoc. Comput. Mach. 23:1976;1-12.
2. Apostolico A. String editing and longest common subsequences. Handbook of Formal Languages. 1996;Springer-Verlag, New York/Berlin. p. 361-398.
3. Bunke H., Csirik J. An improved algorithm for computing the edit distance of run-length coded strings. Inform. Process. Lett. 54:1995;93-96.
4. Hirschberg D. S. An information theoretic lower bound for the longest common subsequence problem. Inform. Process. Lett. 7:1978;40-41.
5. Hirschberg D. S. A linear space algorithm for computing maximal common subsequences. Comm. CACM. 18:1975;341-343.
6. Hirschberg D. S., Larmore L. L. The set-set LCS problem. Algorithmica. 4:1989;503-510.
7. Masek W. J., Paterson M. A faster algorithm computing string edit distances. J. Comput. System Sci. 20:1989;18-31.
8. Mitchell J. Technical Report. 1997.
9. G. Sazaklis, E. Arkin, J. Mitchell, S. Skiena, Geometric decision trees for optical character recognition, Proc. 13th ACM Symposium on Computational Geometry, 1997.
10. Wang B., Chen G., Park K. On the set LCS and set-set LCS problems. J. Algorithms. 14:1993;466-477.