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
Citace podle Chicago (17th ed.)Badkobeh, Golnaz, Alessandro De Luca, Gabriele Fici, a Simon J. Puglisi. "Finding Maximal Closed Substrings." Theoretical Computer Science 1060 (2026): 115628. https://doi.org/10.1016/j.tcs.2025.115628.
Citace podle MLA (9th ed.)Badkobeh, Golnaz, et al. "Finding Maximal Closed Substrings." Theoretical Computer Science, vol. 1060, 2026, p. 115628, https://doi.org/10.1016/j.tcs.2025.115628.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..