Kel’manov, A. V., & Khamidullin, S. A. (2015). An approximation polynomial-time algorithm for a sequence bi-clustering problem. Computational mathematics and mathematical physics, 55(6), 1068-1076. https://doi.org/10.1134/S0965542515060068
Citace podle Chicago (17th ed.)Kel’manov, A. V., a S. A. Khamidullin. "An Approximation Polynomial-time Algorithm for a Sequence Bi-clustering Problem." Computational Mathematics and Mathematical Physics 55, no. 6 (2015): 1068-1076. https://doi.org/10.1134/S0965542515060068.
Citace podle MLA (9th ed.)Kel’manov, A. V., a S. A. Khamidullin. "An Approximation Polynomial-time Algorithm for a Sequence Bi-clustering Problem." Computational Mathematics and Mathematical Physics, vol. 55, no. 6, 2015, pp. 1068-1076, https://doi.org/10.1134/S0965542515060068.