Skip to main content
SpringerLink
Log in

String Rearrangement Metrics: A Survey

  • Chapter
Algorithms and Applications

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

Abstract

A basic assumption in traditional pattern matching is that the order of the elements in the given input strings is correct, while the description of the content, i.e. the description of the elements, may be erroneous. Motivated by questions that arise in Text Editing, Computational Biology, Bit Torrent and Video on Demand, and Computer Architecture, a new pattern matching paradigm was recently proposed by [2]. In this model, the pattern content remains intact, but the relative positions may change. Several papers followed the initial definition of the new paradigm. Each paper revealed new aspects in the world of string rearrangement metrics. This new unified view has already proven itself by enabling the solution of an open problem of the mathematician Cayley from 1849. It also gave better insight to problems that were already studied in different and limited situations, such as the behavior of different cost functions, and enabled deriving results for cost functions that were not yet sufficiently analyzed by previous research. At this stage, a general understanding of this new model is beginning to coalesce. The aim of this survey is to present an overview of this recent new direction of research, the problems, the methodologies, and the state-of-the-art.

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. Amir, A.: Asynchronous pattern matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 1–10. Springer, Heidelberg (2006) (invited Talk)

    Chapter  Google Scholar 

  2. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. In: Proc. 17th SODA, pp. 1221–1229 (2006)

    Google Scholar 

  3. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. Journal of Computer and System Sciences 75(6) (2009)

    Google Scholar 

  4. Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function matching: Algorithms, applications, and a lower bound. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 929–942. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Amir, A., Aumann, Y., Indyk, P., Levy, A., Porat, E.: Efficient computations of ℓ1 and ℓ ∞  rearrangement distances. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 39–49. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Amir, A., Aumann, Y., Indyk, P., Levy, A., Porat, E.: Efficient computations of ℓ1 and ℓ ∞  rearrangement distances. Theoretical Computer Science 410(43), 4382–4390 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 118–129. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. Theoretical Computer Science 410(51) (2009); Special Issue of CPM 2008 Best Papers

    Google Scholar 

  9. Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Information and Computation 181(1), 57–74 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Amir, A., Eisenberg, E., Keller, O., Levy, A., Porat, E.: Approximate string matching with stuck address bits (manuscript)

    Google Scholar 

  11. Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 99–110. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. SIAM Journal on Computing 39(4), 1444–1461 (2009)

    Article  Google Scholar 

  13. Amir, A., Lewenstein, M., Porat, E.: Approximate swapped matching. Information Processing Letters 83(1), 33–39 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Angelov, S., Kunal, K., McGregor, A.: Sorting and selection with random costs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 48–59. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11, 221–240 (1998)

    Article  MathSciNet  Google Scholar 

  16. Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. 15th SODA, pp. 912–921 (2004)

    Google Scholar 

  17. Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y., Swidan, F.: Sorting by length-weighted reversals: Dealing with signs and circularity. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 32–46. Springer, Heidelberg (2004)

    Google Scholar 

  18. Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 168–185. Springer, Heidelberg (1996)

    Google Scholar 

  19. Carpara, A.: Sorting by reversals is difficult. In: Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB), pp. 75–83. ACM Press, New York (1997)

    Google Scholar 

  20. Cayley, A.: Note on the theory of permutations. Philosophical Magazine (34), 527–529 (1849)

    Google Scholar 

  21. Christie, D.A.: Sorting by block-interchanges. Information Processing Letters 60, 165–169 (1996)

    Article  MathSciNet  Google Scholar 

  22. Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM Journal Discrete Math 14, 193–206 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: Proc. 34st Annual Symposium on the Theory of Computing (STOC), pp. 592–601 (2002)

    Google Scholar 

  24. Fischer, M.J., Paterson, M.S.: String matching and other products. In: Karp, R.M. (ed.) SIAM-AMS Proceedings, Complexity of Computation, vol. 7, pp. 113–125 (1974)

    Google Scholar 

  25. Gupta, A., Kumar, A.: Sorting and selection with structured costs. In: Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 416–425 (2001)

    Google Scholar 

  26. Heath, L.S., Vergara, J.P.C.: Sorting by bounded block-moves. Discrete Applied Mathematics 88(1-3), 181–206 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  27. Heath, L.S., Vergara, P.C.: Sorting by short swaps. Journal of Computational Biology 10(5), 775–789 (2003)

    Article  Google Scholar 

  28. Hennessy, J.L., Patterson, D.A.: Computer architecture: A quantitative approach, 3rd edn. Morgan Kauffmann, San Francisco (2002)

    MATH  Google Scholar 

  29. Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theoretical Computer Science 36, 265–289 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  30. Kapah, O., Landau, G.M., Levy, A., Oz, N.: Interchange rearrangement: The element-cost model. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 224–235. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  31. Kapah, O., Landau, G.M., Levy, A., Oz, N.: Interchange rearrangement: The element-cost model. Theoretical Computer Science 410(43), 4315–4326 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  32. Karp, R., Miller, R., Rosenberg, A.: Rapid identification of repeated patterns in strings, arrays and trees. In: Symposium on the Theory of Computing, vol. 4, pp. 125–136 (1972)

    Google Scholar 

  33. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comp. 6, 323–350 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  34. Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. of the ACM, 177–183 (1975)

    Google Scholar 

  35. Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. of the ACM 27, 701–717 (1980)

    Article  MATH  Google Scholar 

  36. Yao, A.C.C.: Some complexity questions related to distributed computing. In: Proc. 11th Annual Symposium on the Theory of Computing (STOC), pp. 209–213 (1979)

    Google Scholar 

  37. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 216–226. Springer, Heidelberg (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Bar Ilan University, Ramat Gan, 52900, Israel

    Amihood Amir

  2. Department of Computer Science, Johns Hopkins University, Baltimore, MD, 21218

    Amihood Amir

  3. Shenkar College, Anna Frank 12, Ramat Gan, 52526, Israel

    Avivit Levy

  4. CRI, University of Haifa, Mount Carmel, Haifa, 31905, Israel

    Avivit Levy

Authors
  1. Amihood Amir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avivit Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software Systems, Tampere University of Technology, P. O. Box 553, 33101, Tampere, Finland

    Tapio Elomaa

  2. Department of Information and Computer Science, Aalto University School of Science and Technology, P.O. Box 17800, 00076, Aalto, Finland

    Heikki Mannila

  3. Department of Information and Computer Science, Aalto University School of Science and Technology, P.O. Box 15400, 00076, Aalto, Finland

    Pekka Orponen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Amir, A., Levy, A. (2010). String Rearrangement Metrics: A Survey. In: Elomaa, T., Mannila, H., Orponen, P. (eds) Algorithms and Applications. Lecture Notes in Computer Science, vol 6060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12476-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12476-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12475-4

  • Online ISBN: 978-3-642-12476-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation