Approximate period detection and correction
Authors: 
Amihood Amir, Avivit LevyAuthors Info & Claims
Amihood Amir, Avivit LevyAuthors Info & ClaimsPages 1 - 15
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.
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)
[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
[3]
Amir, A., Benson, G.: Two-dimensional periodicity and its application. SIAM J. Comp. 27(1), 90-106 (1998)
[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)
[5]
Amir, A., Eisenberg, E., Levy, A., Lewenstein, N.: Closest Periodic Vectors in Lp Spaces. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 714-723. Springer, Heidelberg (2011)
[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)
[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)
[8]
Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Appl. Math. 156(9), 1389-1398 (2008)
[9]
Apostolico, A., Preparata, F.P.: Data structures and algorithms for the string statistics problem. Algorithmica 15(5), 481-494 (1996)
[10]
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. on Discrete Mathematics 11, 221-240 (1998)
[11]
Benson, G.: Sequence alignment with tandem duplication. J. Computational Biology 4(3), 351-368 (1997)
[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)
[13]
Cayley, A.: Note on the theory of permutations. Philosophical Magazine (34), 527- 529 (1849)
[14]
Christie, D.A.: Sorting by block-interchanges. Information Processing Letters 60, 165-169 (1996)
[15]
Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters 12(5), 244-250 (1981)
[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)
[17]
Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News 17(4), 52-54 (1986)
[18]
Galil, Z., Park, K.: Alphabet-independent two-dimensional witness computation. SIAM J. Comp. 25(5), 907-935 (1996)
[19]
Gfeller, B.: Finding longest approximate periodic patterns. In: WADS (2011)
[20]
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. Computer and System Science 13, 338-355 (1984)
[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)
[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)
[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)
[24]
Kolpakov, R.M., Kucherov, G.: Finding approximate repetitions under hamming distance. Theoretical Computer Science 1(303), 135-156 (2003)
[25]
Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239-249 (1986)
[26]
Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)
[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)
[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)
[29]
Sokol, D., Benson, G., Tojeira, J.: Tandem repeats over the edit distance. Bioinformatics 23(2), 30-35 (2007)
[30]
Weiner, P.: Linear pattern matching algorithm. In: Proc. 14 IEEE Symposium on Switching and Automata Theory, pp. 1-11 (1973)
Recommendations
Memory Package Error Detection and Correction
Single error correcting-double error detecting (SEC-DED) codes have been successfully used in computer memories for reliability. In the present-day technology of very large scale integration storage arrays bit error correction as well as byte error ...
Approximate Quantum Error Correction
The errors that arise in a quantum channel can be corrected perfectly if and only if the channel does not decrease the coherent information of the input state. We show that, if the loss of coherent information is small, then approximate quantum error ...
Comments
Information & Contributors
Information
Published In
October 2012
410 pages
ISBN:9783642341083
Sponsors
- Electro Software: Electro Software
- Yahoo! Research
- Google Inc.
- Information Technology Research Group: Information Technology Research Group
- Universidad Autónoma de Bucaramanga: Universidad Autónoma de Bucaramanga
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 21 October 2012
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Oct 2024