Longest common subsequence between run-length-encoded strings: A new algorithm with improved parallelism

Information Processing Letters

Volumn 90, Issue 4, 2004, Pages 167-173

  Freschi, Valerio ^a   Bogliolo, Alessandro ^a  

^a UNIVERSITY OF URBINO   (Italy)

Author keywords

Algorithms; Longest common subsequence; Parallel processing; Run length encoding; String comparison

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PARALLEL PROCESSING SYSTEMS; RECURSIVE FUNCTIONS;

RUN-LENGTH ENCODING; STRING COMPARISION;

DATA PROCESSING;

EID: 1842787419     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.02.011     Document Type: Article

References (14)

1. Apostolico A., Landau G., Skiena S. Matching for run-length encoded strings. J. Complexity. 15:(1):1999;4-16.
2. Arbell O., Landau G.M., Mitchell J.S.B. Edit distance of run-length encoded strings. Inform. Process. Lett. 83:2002;307-314.
3. Baker B.S., Giancarlo R. Sparse dynamic programming for longest common subsequence from fragments. J. Algorithms. 42:2002;231-254.
4. Bunke H., Csirik J. An improved algorithm for computing the edit distance of run length coded strings. Inform. Process. Lett. 54:1995;93-96.
5. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
6. Crochemore M., Iliopoulos C.S., Pinzon Y.J., Reid J.F. A fast and practical bit vector algorithm for the longest common subsequence problem. Inform. Process. Lett. 80:2001;279-285.
7. Crochemore M., Landau G.M., Ziv-Ukelson M. A subquadratic sequence alignment algorithm for unrestricted cost matrices. Proceedings of ACM-SIAM Symposium on Discrete Algorithms. 2002;679-688.
8. Eppstein D., Galil Z., Giancarlo R., Italiano G. Sparse dynamic programming I: Linear cost functions. J. ACM. 39:1992;519-545.
9. Hirschberg D.S. Algorithms for the longest common subsequence problem. J. ACM. 24:(4):1977;664-675.
10. Hunt J.W., Szymanski T.G. A fast algorithm for computing longest common subsequences. Comm. ACM. 20:1977;350-353.
11. T. Kahveci, A. Singh, Accelerating substring searching: breaking the I/O barrier, UCSB Technical Report, 2002.
12. Lopresti D. P-NAC: a systolic array for comparing nucleic acid sequences. Computer. 24:(11):1987;6-13.
13. Sayoood K., Fow E. Introduction to Data Compression. second ed. 2000;Morgan Kaufmann, Los Altos, CA.
14. Ziv J., Lempel A. Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory. II-24:1978;530-536.