Abstract
Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. In this paper, we introduce the notions of binary and ternary correlations, which are binary and ternary vectors indicating the periods and weak periods of partial words. Extending a result of Guibas and Odlyzko, we characterize precisely which of these vectors represent the (weak) period sets of partial words and prove that all valid correlations may be taken over the binary alphabet. We show that the sets of all such vectors of a given length form distributive lattices under inclusion. We also show that there is a well defined minimal set of generators for any binary correlation of length n and demonstrate that these generating sets are the primitive subsets of {1, 2,..., n − 1}. Finally, we investigate the number of correlations of length n.
This material is based upon work supported by the National Science Foundation under Grant No. DMS–0452020. A World Wide Web server interface has been established at www.uncg.edu/mat/research/correlations for automated use of the program. We thank the referees of a preliminary version of this paper for their very valuable comments and suggestions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J., Boasson, L.: Partial Words and a Theorem of Fine and Wilf. Theoret. Comput. Sci. 218, 135–141 (1999)
Blanchet-Sadri, F.: Periodicity on Partial Words. Comput. Math. Appl. 47, 71–82 (2004)
Blanchet-Sadri, F.: Chriscoe, Ajay: Local Periods and Binary Partial Words: An Algorithm. Theoret. Comput. Sci. 314, 189–216 (2004), http://www.uncg.edu/mat/AlgBin
Blanchet-Sadri, F., Duncan, S.: Partial Words and the Critical Factorization Theorem. J. Combin. Theory Ser. A 109, 221–245 (2005), http://www.uncg.edu/mat/cft
Blanchet-Sadri, F., Hegstrom, R.A.: Partial Words and a Theorem of Fine and Wilf Revisited. Theoret. Comput. Sci. 270, 401–419 (2002)
Blanchet-Sadri, F., Wetzler, N.D.: Partial Words and the Critical Factorization Theorem Revisited. http://www.uncg.edu/mat/research/cft2
Césari, Y., Vincent, M.: Une Caractérisation des Mots Périodiques. C.R. Acad. Sci. Paris 268, 1175–1177 (1978)
Erdös, P.: Note on Sequences of Integers No One of Which is Divisible by Another. J. London Math. Soc. 10, 126–128 (1935)
Fine, N.J., Wilf, H.S.: Uniqueness Theorems for Periodic Functions. Proc. Amer. Math. Soc. 16, 109–114 (1965)
Guibas, L.J., Odlyzko, A.M.: Periods in Strings. J. Combin. Theory Ser. A 30, 19–42 (1981)
Kolpakov, R., Kucherov, G.: Finding Approximate Repetitions Under Hamming Distance. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 170–181. Springer, Heidelberg (2001)
Kolpakov, R., Kucherov, G.: Finding Approximate Repetitions Under Hamming Distance. Theoret. Comput. Sci. 33, 135–156 (2003)
Landau, G., Schmidt, J.: An Algorithm for Approximate Tandem Repeats. In: Apostolico, A., et al. (eds.) CPM 1993. LNCS, vol. 684, pp. 120–133. Springer, Heidelberg (1993)
Landau, G.M., Schmidt, J.P., Sokol, D.: An Algorithm for Approximate Tandem Repeats. J. Comput. Biology 8, 1–18 (2001)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Rivals, E., Rahmann, S.: Combinatorics of Periods in Strings. J. Combin. Theory Ser. A 104, 95–113 (2003)
Schmidt, J.P.: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. SIAM J. Comput. 27, 972–992 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Blanchet-Sadri, F., Gafni, J.D., Wilson, K.H. (2007). Correlations of Partial Words. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)