Abstract
Quasiperiodic strings were defined by Apostolico and Ehrenfeucht [3], as strings which are entirly covered by occurrences of another(shorter) string. This paper surveys a handful of results on the structure and detection of quasiperiodic strings and on related string covers,attempting to simplify and present in a uniform manner the algorithms being surveyed.
Partially supported by NSF Grant CCR-92-01078, by NATO Grant CRG 900293, by British Engineering and Physical Sciences Research Council grant GR/L19362, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (Project GEPPCOM).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Apostolico. The Myriad Virtues of Subword Trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO ASI Series F, pages 85–96. Springer-Verlag, Berlin, Germany, 1985.
A. Apostolico, D. Breslauer, and Z. Galil. Optimal Parallel Algorithms for Periods, Palindromes and Squares. In Proc. 19th International Colloquium on Automata, Languages, and Programming, number 623 in Lecture Notes in Computer Science, pages 296–307. Springer-Verlag, Berlin, Germany, 1992.
A. Apostolico and A. Ehrenfeucht. Efficient Detection of Quasiperiodicities in Strings. Theoret. Comput. Sci., 119:247–265, 1993.
A. Apostolico, M. Farach, and C.S. Iliopoulos. Optimal Superprimitivity Testing for Strings. Inform. Process. Lett., 39:17–20, 1991.
A. Ben-Amram, O. Berkman, C. Iliopolous, and K. Park. Computing the Covers of a String in Linear Tme. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 501–510, 1994.
A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen and J. Seiferas. The Smallest Automaton Recognizing the Subwords of a Text, Theoretical Computer Science, 40:31–55, 1985.
A. Blumer, A. J. Blumer, A. Ehrenfeucht, D. Haussler, and R. McConnell. Complete Inverted Files for Efficient Text Retrieval and Analysis. Journal of the ACM, 34(3): 578–595 (1987).
R.P. Brent. Evaluation of General Arithmetic Axpressions. J. Assoc. Comput. Mach., 21:201–206, 1974.
D. Breslauer. An On-Line String Superprimitivity Test. Inform. Process. Lett., 44(6):345–347, 1992.
D. Breslauer. Testing String Superprimitivity in Parallel. Inform. Process. Lett., 49(5):235–241, 1994.
D. Breslauer and Z. Galil. A Lower Bound for Parallel String Matching. SIAM J. Comput., 21(5):856–862, 1992.
D. Breslauer and Z. Galil. Finding all Periods and Initial Palindromes of a String in Parallel. Algorithmica, 1995.
M.T. Chen and J. Seiferas. Efficient and Elegant Subword-tree Construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO ASI Series F, pages 97–107. Springer-Verlag, Berlin, Germany, 1985.
R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Hariharan, S. Muthukrishnan, K. Park, and W. Rytter. Optimally Fast Parallel Algorithms for Preprocessing and Pattern Matching in One and Two Dimensions. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 248–258, 1993.
F.E. Fich, R.L. Ragde, and A. Wigderson. Relations Between Concurrent-write Models of Parallel Computation. SIAM J. Comput., 17(3):606–627, 1988.
N.J. Fine and H.S. Wilf. Uniqueness Theorems for Periodic Functions. Proc. Amer. Math. Soc., 16:109–114, 1965.
R. Grossi and G.F. Italiano. Suffix Trees and their Applications in String Algorithms. Manuscript, 1995.
C.S. Iliopoulos, D.W.G. Moore, and K. Park. Covering a String. In Proc. 4th Symp. on Combinatorial Pattern Matching, number 684 in Lecture Notes in Computer Science, pages 54–62, Berlin, Germany, 1993. Springer-Verlag.
C.S. Iliopoulos and K. Park. An Optimal O(loglogn)-time Algorithm for Parallel Superprimitivity Testing. J. Korea Information Science Society, 21(8): 1400–1404, 1994.
D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast Pattern Matching in Strings. SIAM J. Comput., 6:322–350, 1977.
M. Lothaire. Combinatorics on Words. Addison-Wesley, Reading, MA, U.S.A., 1983.
U. Manber and E. Myers. Suffix Arrays: a New Method for On-line String Searches. Proceedings of the 1st Symposium on Discrete Algorithms, 319–327, 1990.
E.M. McCreight. A Space Economical Suffix Tree Construction Algorithm. J. Assoc. Comput. Mack., 23:262–272, 1976.
D. Moore and W.F. Smyth. Computing the Covers of a String in Linear Time. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 511–515, 1994.
E. Ukkonen. Constructin Suffix Trees On-line in Linear Time. Proceedings of Information Processing 92, Vol. 1, 484–492, 1992.
P. Weiner. Linear Pattern Matching Algorithms. In Proc. 14th Symposium on Switching and Automata Theory, pages 1–11, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Apostolico, A., Breslauer, D. (1997). Of periods, quasiperiods, repetitions and covers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds) Structures in Logic and Computer Science. Lecture Notes in Computer Science, vol 1261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63246-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-63246-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63246-7
Online ISBN: 978-3-540-69242-3
eBook Packages: Springer Book Archive