Nakamura, A., Saito, T., Takigawa, I., Kudo, M., & Mamitsuka, H. (2013). Fast algorithms for finding a minimum repetition representation of strings and trees. Discrete Applied Mathematics, 161(10-11), 1556-1575. https://doi.org/10.1016/j.dam.2012.12.013
Citácia podle Chicago (17th ed.)Nakamura, Atsuyoshi, Tomoya Saito, Ichigaku Takigawa, Mineichi Kudo, a Hiroshi Mamitsuka. "Fast Algorithms for Finding a Minimum Repetition Representation of Strings and Trees." Discrete Applied Mathematics 161, no. 10-11 (2013): 1556-1575. https://doi.org/10.1016/j.dam.2012.12.013.
Citácia podľa MLA (8th ed.)Nakamura, Atsuyoshi, et al. "Fast Algorithms for Finding a Minimum Repetition Representation of Strings and Trees." Discrete Applied Mathematics, vol. 161, no. 10-11, 2013, pp. 1556-1575, https://doi.org/10.1016/j.dam.2012.12.013.