Years and Authors of Summarized Original Work
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Apostolico A, Preparata FP (1983) Optimal off-line detection of repetitions in a string. Theor Comput Sci 22(3):297–315
Crochemore M (1981) An optimal algorithm for computing the repetitions in a word. Inf Process Lett 12(5):244–250
Crochemore M (1986) Transducers and repetitions. Theor Comput Sci 45(1):63–86
Crochemore M, Ilie L (2007) Analysis of maximal repetitions in strings. J Comput Sci
Crochemore M, Rytter W (1995) Squares, cubes, and time-space efficient string searching. Algorithmica 13(5):405–425
Crochemore M, Rytter W (2003) Jewels of stringology. World Scientific, Singapore
Franek F, Karaman A, Smyth WF (2000) Repetitions in Sturmian strings. Theor Comput Sci 249(2):289–303
Fraenkel AS, Simpson RJ (1998) How many squares can a string contain? J Comb Theory Ser A 82:112–120
Fraenkel AS, Simpson RJ (1999) The exact number of squares in fibonacci words. Theor Comput Sci 218(1):95–106
Franek F, Simpson RJ, Smyth WF (2003) The maximum number of runs in a string. In: Proceedings of the 14-th Australian workshop on combinatorial algorithms. Curtin University Press, Perth, pp 26– 35
Franek F, Smyth WF, Tang Y (2003) Computing all repeats using suffix arrays. J Autom Lang Comb 8(4):579–591
Gusfield D, Stoye J (2004) Linear time algorithms for finding and representing all the tandem repeats in a string. J Comput Syst Sci 69(4):525–546
Ilie L (2005) A simple proof that a word of length n has at most 2n distinct squares. J Comb Theory Ser A 112(1):163–164
Iliopoulos C, Moore D, Smyth WF (1997) A characterization of the squares in a Fibonacci string. Theor Comput Sci 172:281–291
Kolpakov R, Kucherov G (1999) Finding maximal repetitions in a word in linear time. In: Proceedings of the 40th symposium on foundations of computer science. IEEE Computer Society, Los Alamitos, pp 596–604
Lothaire M (ed) (2002) Algebraic combinatorics on words. Cambridge University Press, Cambridge
Lothaire M (ed) (2005) Applied combinatorics on words. Cambridge University Press, Cambridge
Main MG (1989) Detecting leftmost maximal periodicities. Discret Appl Math 25:145–153
Main MG, Lorentz RJ (1984) An O(n log n) algorithm for finding all repetitions in a string. J Algorithms 5(3):422–432
Rytter W (2006) The structure of subword graphs and suffix trees of Fibonacci words. In: Implementation and application of automata, CIAA 2005. Lecture notes in computer science, vol 3845. Springer, Berlin, pp 250–261
Rytter W (2006) The number of runs in a string: improved analysis of the linear upper bound. In: Proceedings of the 23rd annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 3884. Springer, Berlin, pp 184–195
Smyth WF (2000) Repetitive perhaps, but certainly not boring. Theor Comput Sci 249(2):343–355
Smyth WF (2003) Computing patterns in strings. Addison-Wesley, Boston
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Crochemore, M., Rytter, W. (2016). Squares and Repetitions. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_392
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_392
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering