Puglisi, S. J., Smyth, W. F., & Yusufu, M. (2010). Fast, Practical Algorithms for Computing All the Repeats in a String. Mathematics in computer science, 3(4), 373-389. https://doi.org/10.1007/s11786-010-0033-6
Chicago Style (17th ed.) CitationPuglisi, Simon J., W. F. Smyth, and Munina Yusufu. "Fast, Practical Algorithms for Computing All the Repeats in a String." Mathematics in Computer Science 3, no. 4 (2010): 373-389. https://doi.org/10.1007/s11786-010-0033-6.
MLA (9th ed.) CitationPuglisi, Simon J., et al. "Fast, Practical Algorithms for Computing All the Repeats in a String." Mathematics in Computer Science, vol. 3, no. 4, 2010, pp. 373-389, https://doi.org/10.1007/s11786-010-0033-6.
Warning: These citations may not always be 100% accurate.