Skip to main content
SpringerLink
Log in

Approximate Period Detection and Correction

  • Conference paper
String Processing and Information Retrieval (SPIRE 2012)

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

Included in the following conference series:

Abstract

Periodicity has been historically well studied and has numerous applications. In nature, however, few cyclic phenomena have an exact period.

This paper surveys some recent results in approximate periodicity: concept definition, discovery or recovery, techniques and efficient algorithms. We will also show some interesting connections between error correction codes and periodicity.

We will try to pinpoint the issues involved, the context in the literature, and possible future research directions.

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., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1221–1229 (2006)

    Google Scholar 

  2. Amir, A., Aumann, Y., Landau, G., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. Journal of Algorithms 37, 247–266 (2000); Preliminary version appeared at FOCS 1997

    Article  MathSciNet  MATH  Google Scholar 

  3. Amir, A., Benson, G.: Two-dimensional periodicity and its application. SIAM J. Comp. 27(1), 90–106 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Amir, A., Eisenberg, E., Levy, A.: Approximate Periodicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol. 6506, pp. 25–36. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Amir, A., Eisenberg, E., Levy, A., Lewenstein, N.: Closest Periodic Vectors in L p Spaces. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 714–723. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Amir, A., Eisenberg, E., Levy, A., Porat, E., Shapira, N.: Cycle Detection and Correction. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 43–54. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. 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 

  8. Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Appl. Math. 156(9), 1389–1398 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Apostolico, A., Preparata, F.P.: Data structures and algorithms for the string statistics problem. Algorithmica 15(5), 481–494 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Benson, G.: Sequence alignment with tandem duplication. J. Computational Biology 4(3), 351–368 (1997)

    Article  Google Scholar 

  12. 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)

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters 12(5), 244–250 (1981)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  17. Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News 17(4), 52–54 (1986)

    Article  Google Scholar 

  18. Galil, Z., Park, K.: Alphabet-independent two-dimensional witness computation. SIAM J. Comp. 25(5), 907–935 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gfeller, B.: Finding longest approximate periodic patterns. In: WADS (2011)

    Google Scholar 

  20. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. Computer and System Science 13, 338–355 (1984)

    MathSciNet  MATH  Google Scholar 

  21. Kärkkäinen, J., Sanders, P.: Simple Linear Work Suffix Array Construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943–955. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  22. Kasai, T., Lee, G.H., Arimura, H., Arikawa, S., Park, K.: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181–192. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  23. Kolpakov, R.M., Bana, G., Kucherov, G.: mreps: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Research 31(13), 3672–3678 (2003)

    Article  Google Scholar 

  24. Kolpakov, R.M., Kucherov, G.: Finding approximate repetitions under hamming distance. Theoretical Computer Science 1(303), 135–156 (2003)

    Article  MathSciNet  Google Scholar 

  25. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239–249 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  26. Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)

    Google Scholar 

  27. Régnier, M., Rostami, L.: A Unifying Look at d-dimensional Periodicities and Space Coverings. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol. 684, pp. 215–227. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  28. Sim, J.S., Park, K., Kim, S., Lee, J.: Finding approximate covers of strings. J. Korea Information Science Society 29(1), 16–21 (2001)

    Google Scholar 

  29. Sokol, D., Benson, G., Tojeira, J.: Tandem repeats over the edit distance. Bioinformatics 23(2), 30–35 (2007)

    Article  Google Scholar 

  30. Weiner, P.: Linear pattern matching algorithm. In: Proc. 14 IEEE Symposium on Switching and Automata Theory, pp. 1–11 (1973)

    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, USA

    Amihood Amir

  3. Department of Software Engineering, Shenkar College, 12 Anna Frank, Ramat-Gan, Israel

    Avivit Levy

  4. CRI, Haifa University, 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. Information Technologies Research Group, Universidad Autónoma de Bucaramanga, Bucaramanga, Colombia

    Liliana Calderón-Benavides

  2. Information Technologies and Research Group, Universidad Autónoma de Bucaramanga, Bucaramanga, Colombia

    Cristina González-Caro

  3. School of Physics and Mathematics, Universidad Michoacana, Edificio ”B”, Ciudad Universitaria,, 58000, Morelia, Mexico

    Edgar Chávez

  4. Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antonio Carlos 6627, Pampulha, 31270-010, Belo Horizonte, Brazil

    Nivio Ziviani

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amir, A., Levy, A. (2012). Approximate Period Detection and Correction. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds) String Processing and Information Retrieval. SPIRE 2012. Lecture Notes in Computer Science, vol 7608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34109-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34109-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34108-3

  • Online ISBN: 978-3-642-34109-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation