Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: 12th International Conference on Pattern Recognition Systems, ICPRS 2022

Год издания: 2022

Идентификатор DOI: 10.1109/ICPRS54038.2022.9854064

Ключевые слова: comparison, convolution, genome, measure

Аннотация: The paper proposes a novel application of a highly efficient method for comparing symbol sequences based on convolution. The technique utilizes Fast Fourier Transform (FFT) to compare long symbol sequences achieving practical results using commodity PC hardware. While the main focus is on bioinformatics, the proposed approach is general and can work beyond genetic sequences. One of the main advantages of the proposed method is the robustness to insertion/deletion. Also, unlike standard alignment algorithms, the proposed method is parameter-free. The paper shows that the FFT-based comparison allows for efficient clustering of long sequences in bioinformatics as a practical application. Exploration of coronaviruses offers an illustration of the proposed clustering techniques. © 2022 IEEE.

Журнал: 2022 12th International Conference on Pattern Recognition Systems, ICPRS 2022

Издатель: Institute of Electrical and Electronics Engineers Inc.

• Molyavko A. (Siberian Federal University, Krasnoyarsk, Russian Federation)
• Borovikov I. (Nekkar.netCA, United States)
• Karepova E. (Institute for Computational Modeling SB RAS, Krasnoyarsk, Russian Federation)
• Sadovsky M. (Institute for Computational Modeling SB RAS, Krasnoyarsk, Russian Federation)

• Scopus