Abstract
New error tolerant method for the comparison and analysis of symbol sequences is proposed. The method is based on convolution function calculation, where the function is defined over the binary numeric sequences obtained by the specific transformation of original symbol sequence. The method allows highly parallel implementation and is of great value for insertion/delition mutations search. To calculate the convolution function, fast Fourier transform is used in the method implementation.
Author supplied keywords
Cite
CITATION STYLE
Molyavko, A., Shaidurov, V., Karepova, E., & Sadovsky, M. (2020). Highly Parallel Convolution Method to Compare DNA Sequences with Enforced In/Del and Mutation Tolerance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12108 LNBI, pp. 472–481). Springer. https://doi.org/10.1007/978-3-030-45385-5_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
