Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I., Pyatkin, A. V., Shamardin, Y. V., & Shenmaier, V. V. (2018). A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements. Pattern recognition and image analysis, 28(3), 363-370. https://doi.org/10.1134/S1054661818030094
Citace podle Chicago (17th ed.)Kel’manov, A. V., S. A. Khamidullin, V. I. Khandeev, A. V. Pyatkin, Yu. V. Shamardin, a V. V. Shenmaier. "A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements." Pattern Recognition and Image Analysis 28, no. 3 (2018): 363-370. https://doi.org/10.1134/S1054661818030094.
Citace podle MLA (9th ed.)Kel’manov, A. V., et al. "A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements." Pattern Recognition and Image Analysis, vol. 28, no. 3, 2018, pp. 363-370, https://doi.org/10.1134/S1054661818030094.