Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time.

@inproceedings{badkobeh-2012-computing, author = {Golnaz Badkobeh and Maxime Crochemore and Chalita Toopsuwan}, editor = {Liliana Calder\'{o}n-Benavides and Cristina N. Gonz\'{a}lez-Caro and Edgar Ch\'{a}vez and Nivio Ziviani}, title = {{Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time}}, booktitle = {{String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {61--72}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0_8}, doi = {https://doi.org/10.1007/978-3-642-34109-0_8} }