Skip to main content
SpringerLink
Log in

Computing the Longest Common Subsequence of Two Run-Length Encoded Strings

  • Conference paper
Algorithms and Computation (ISAAC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7676))

Included in the following conference series:

  • 1511 Accesses

Abstract

The present article reveals that the problem of finding the longest common subsequence of two strings given in run-length encoded form can be solved in O(mn loglog min (m, n, M/m, N/n, X)) time, where one input string is of length M with m runs, the other is of length N with n runs, and X is the average difference between the length of a run from one input string and that of a run from the other.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ann, H.Y., Yang, C.B., Tseng, C.T., Hor, C.Y.: A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings. Inform. Process. Lett. 108, 360–364 (2008)

    Article  MathSciNet  Google Scholar 

  2. Apostolico, A., Landau, G.M., Skiena, S.: Matching for run-length encoded strings. J. Complexity 15, 4–16 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bunke, H., Csirik, J.: An improved algorithm for computing the edit distance of run-length coded strings. Inform. Process. Lett. 54, 93–96 (1995)

    Article  MATH  Google Scholar 

  4. Chen, K.-Y., Chao, K.-M.: A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 415–426. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM J. Comput. 32, 1654–1673 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Han, Y.: Deterministic sorting in O(n loglogn) time and linear space. J. Algorithms 50, 96–105 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kim, J.W., Amir, A., Landau, G.M., Park, K.: Computing similarity of run-length encoded strings with affine gap penalty. Theor. Comput. Sci. 395, 268–282 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Liu, J.J., Wang, Y.L., Lee, R.C.T.: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. J. Complexity 24, 173–184 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mäkinen, V., Navarro, G., Ukkonen, E.: Approximate Matching of run-length compressed strings. Algorithmica 35, 347–369 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mitchell, J.: A geometric shortest path problem, with application to computing a longest common subsequence in run-length encoded strings. Technical Report, Department of Applied Mathematics, Suny Stony Brook, NY (1997)

    Google Scholar 

  11. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6, 80–82 (1977)

    Article  MATH  Google Scholar 

  12. Wagner, R.A., Fischer, M.J.: The string to string correction problem. J. ACM 21, 168–173 (1974)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Agricultural Science, Tohoku University, 1-1 Amamiya-machi, Tsutsumidori, Aoba-ku, Sendai, 981-8555, Japan

    Yoshifumi Sakai

Authors
  1. Yoshifumi Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University, 1 Roosevelt Road, Section 4, 106, Taipei, Taiwan

    Kun-Mao Chao

  2. Institute of Information Science, Academia Sinica, 128 Academia Road, Section 2, 115, Taipei, Taiwan

    Tsan-sheng Hsu

  3. Department of Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, 402, Taichung, Taiwan

    Der-Tsai Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakai, Y. (2012). Computing the Longest Common Subsequence of Two Run-Length Encoded Strings. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35261-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35260-7

  • Online ISBN: 978-3-642-35261-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation