Amir, A., Charalampopoulos, P., Pissis, S. P., & Radoszewski, J. (2020). Dynamic and Internal Longest Common Substring. Algorithmica, 82(12), 3707-3743. https://doi.org/10.1007/s00453-020-00744-0
Citace podle Chicago (17th ed.)Amir, Amihood, Panagiotis Charalampopoulos, Solon P. Pissis, a Jakub Radoszewski. "Dynamic and Internal Longest Common Substring." Algorithmica 82, no. 12 (2020): 3707-3743. https://doi.org/10.1007/s00453-020-00744-0.
Citace podle MLA (9th ed.)Amir, Amihood, et al. "Dynamic and Internal Longest Common Substring." Algorithmica, vol. 82, no. 12, 2020, pp. 3707-3743, https://doi.org/10.1007/s00453-020-00744-0.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..