Badkobeh, G., De Luca, A., Fici, G., & Puglisi, S. J. (2026). Finding maximal closed substrings. Theoretical computer science, 1060, 115628. https://doi.org/10.1016/j.tcs.2025.115628
Chicago Style (17th ed.) CitationBadkobeh, Golnaz, Alessandro De Luca, Gabriele Fici, and Simon J. Puglisi. "Finding Maximal Closed Substrings." Theoretical Computer Science 1060 (2026): 115628. https://doi.org/10.1016/j.tcs.2025.115628.
MLA (9th ed.) CitationBadkobeh, Golnaz, et al. "Finding Maximal Closed Substrings." Theoretical Computer Science, vol. 1060, 2026, p. 115628, https://doi.org/10.1016/j.tcs.2025.115628.
Warning: These citations may not always be 100% accurate.