Skip to main content
SpringerLink
Log in

Similarity Between Compressed Strings

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 41 Accesses

Years and Authors of Summarized Original Work

  • 2005; Kim, Amir, Landau, Park

Table 1 Various scoring metrics
Full size table

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Apostolico A, Landau GM, Skiena S (1999) Matching for run length encoded strings. J Complex 15(1):4–16

    Article  MathSciNet  MATH  Google Scholar 

  2. Arbell O, Landau GM, Mitchell J (2002) Edit distance of run-length encoded strings. Inf Process Lett 83(6):307–314

    Article  MathSciNet  MATH  Google Scholar 

  3. Baeza-Yates R, Navaro G (2000) New models and algorithms for multidimensional approximate pattern matching. J Discret Algorithm 1(1):21–49

    MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Crochemore M, Landau GM, Schieber B, Ziv-Ukelson M (2005) Re-use dynamic programming for sequence alignment: an algorithmic toolkit. In: Iliopoulos CS, Lecroq T (eds) String algorithmics. King's College London Publications, London, pp 19–59

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Fredriksson K, Navarro G, Ukkonen E (2005) Sequential and indexed two-dimensional combinatorial template matching allowing rotations. Theor Comput Sci 347(1–2):239–275

    Article  MathSciNet  MATH  Google Scholar 

  8. Kim JW, Amir A, Landau GM, Park K (2005) Computing similarity of run-length encoded strings with affine gap penalty. In: Proceedings of the 12th symposium on string processing and information retrieval (SPIRE'05), LNCS, vol 3772, pp 440–449

    Google Scholar 

  9. Krithivasan K, Sitalakshmi R (1987) Efficient two-dimensional pattern matching in the presence of errors. Inf Sci 43:169–184

    Article  Google Scholar 

  10. Mäkinen V, Navarro G, Ukkonen E (2001) Approximate matching of run-length compressed strings. In: Proceedings of the 12th symposium on combinatorial pattern matching (CPM'01). LNCS, vol 2089, pp 31–49

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Mitchell J (1997) 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

    Google Scholar 

  13. Wagner RA, Fischer MJ (1974) The string-to-string correction problem. J ACM 21(1):168–173

    Article  MathSciNet  MATH  Google Scholar 

  14. Ziv J, Lempel A (1978) Compression of individual sequences via variable rate coding. IEEE Trans Inf Theory 24(5):530–536

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HM Research, Seoul, Korea

    Jin Wook Kim

  2. Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

    Amihood Amir

  3. Department of Computer Science, University of Haifa, Haifa, Israel

    Gad M. Landau

  4. School of Computer Science and Engineering, Seoul National University, Seoul, Korea

    Kunsoo Park

  5. Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA

    Amihood Amir

Authors
  1. Jin Wook Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amihood Amir
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gad M. Landau
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kunsoo Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jin Wook Kim .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Kim, J.W., Amir, A., Landau, G., Park, K. (2016). Similarity Between Compressed Strings. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_375

Download citation

Publish with us

Policies and ethics

Search

Navigation