Top

Published in:

2020 | OriginalPaper | Chapter

Highly Parallel Convolution Method to Compare DNA Sequences with Enforced In/Del and Mutation Tolerance

Authors : Anna Molyavko, Vladimir Shaidurov, Eugenia Karepova, Michael Sadovsky

Published in: Bioinformatics and Biomedical Engineering

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter An Overview of Search and Match Algorithms Complexity and Performance

next chapter A Mini Review on Parallel Processing of Brain Magnetic Resonance Imaging

Actually, there is no difference between insertion and deletion: changing a reference sequence, one always is able to convert the situation to a single mutation, e. g. to insertion.

Tsarev, S.P., Sadovsky, M.G.: New error tolerant method for search of long repeats in DNA sequences. In: Botón-Fernández, M., Martín-Vide, C., Santander-Jiménez, S., Vega-Rodríguez, M.A. (eds.) AlCoB 2016. LNCS, vol. 9702, pp. 171–182. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-38827-4_14CrossRef

Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403–410 (1990)CrossRef

Freschi, V., Bogliolo, A.: A faster algorithm for the computation of string convolutions using lz78 parsing. Inform. Process. Lett. 110(14), 609–613 (2010)CrossRef

Freschi, V., Bogliolo, A.: Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism. Inform. Process. Lett. 90(4), 167–173 (2004)CrossRef

Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Knowl. Inf. Syst. 3(3), 263–286 (2001)CrossRef

Katoh, K., Misawa, K., Kuma, K.I., Miyata, T.: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res. 30(14), 3059–3066 (2002)CrossRef

Janacek, G.J., Bagnall, A.J., Powell, M.: A likelihood ratio distance measure for the similarity between the Fourier transform of time series. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 737–743. Springer, Heidelberg (2005). https://doi.org/10.1007/11430919_85CrossRef

Hetland, M.L.: A survey of recent methods for efficient retrieval of similar time sequences. In: Data Mining in Time Series Databases, pp. 23–42. World Scientific (2004)

Benson, D.C.: Fourier methods for biosequence analysis. Nucleic Acids Res. 18(21), 6305–6310 (1990)CrossRef

10.

Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Pearson Education India, Bengaluru (1974)

11.

Baase, S.: Computer Algorithms: Introduction to Design and Analysis. Pearson Education India, Bengaluru (2009)

12.

Kozen, D.C.: The Design and Analysis of Algorithms. Springer, Heidleberg (2012)

13.

Levenshtein, V.I.: Bounds for deletion/insertion correcting codes. In: Proceedings IEEE International Symposium on Information Theory, p. 370. IEEE (2002)

14.

Merhi, S., Zhang, R., Iwen, M.A., Christlieb, A.: A new class of fully discrete sparse fourier transforms: faster stable implementations with guarantees. J. Fourier Anal. Appl. 25(3), 751–784 (2019)CrossRef

15.

Karam, C., Sugimoto, K., Hirakawa, K.: Fast convolutional distance transform. IEEE Signal Process. Lett. 26(6), 853–857 (2019)CrossRef

Title: Highly Parallel Convolution Method to Compare DNA Sequences with Enforced In/Del and Mutation Tolerance
Authors: Anna Molyavko
Vladimir Shaidurov
Eugenia Karepova
Michael Sadovsky
Publisher: Springer International Publishing
Book: Bioinformatics and Biomedical Engineering
Print ISBN: 978-3-030-45384-8

Electronic ISBN: 978-3-030-45385-5

Copyright Year: 2020
DOI: https://doi.org/10.1007/978-3-030-45385-5_42

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner