Amir, A., Lewenstein, M., & Porat, E. (2004). Faster algorithms for string matching with k mismatches. Journal of algorithms, 50(2), 257-275. https://doi.org/10.1016/S0196-6774(03)00097-X
Citace podle Chicago (17th ed.)Amir, Amihood, Moshe Lewenstein, a Ely Porat. "Faster Algorithms for String Matching with K Mismatches." Journal of Algorithms 50, no. 2 (2004): 257-275. https://doi.org/10.1016/S0196-6774(03)00097-X.
Citace podle MLA (9th ed.)Amir, Amihood, et al. "Faster Algorithms for String Matching with K Mismatches." Journal of Algorithms, vol. 50, no. 2, 2004, pp. 257-275, https://doi.org/10.1016/S0196-6774(03)00097-X.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..