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

Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan. Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. In Liliana Calderón-Benavides, Cristina N. González-Caro, Edgar Chávez, Nivio Ziviani, editors, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings. Volume 7608 of Lecture Notes in Computer Science, pages 61-72, Springer, 2012. [doi]

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