Asahiro, Y., Jansson, J., Lin, G., Miyano, E., Ono, H., & Utashima, T. (2024). Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discrete Applied Mathematics, 353, 44-64. https://doi.org/10.1016/j.dam.2024.04.006
Citácia podle Chicago (17th ed.)Asahiro, Yuichi, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, a Tadatoshi Utashima. "Polynomial-time Equivalences and Refined Algorithms for Longest Common Subsequence Variants." Discrete Applied Mathematics 353 (2024): 44-64. https://doi.org/10.1016/j.dam.2024.04.006.
Citácia podľa MLA (8th ed.)Asahiro, Yuichi, et al. "Polynomial-time Equivalences and Refined Algorithms for Longest Common Subsequence Variants." Discrete Applied Mathematics, vol. 353, 2024, pp. 44-64, https://doi.org/10.1016/j.dam.2024.04.006.