Apache Spark Implementations for String Patterns in DNA Sequences

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The availability of numerical data grows from 1 day to another in a remarkable way. New technologies of high-throughput Next-Generation Sequencing (NGS) are producing DNA sequences. Next-Generation Sequencing describes a DNA sequencing technology which has revolutionized genomic research. In this paper, we perform some experiments using a cloud infrastructure framework, namely, Apache Spark, in some sequences derived from the National Center for Biotechnology Information (NCBI). The problems we examine are some of the most popular ones, namely, Longest Common Prefix, Longest Common Substring, and Longest Common Subsequence.

Cite

CITATION STYLE

APA

Kanavos, A., Livieris, I., Mylonas, P., Sioutas, S., & Vonitsanos, G. (2020). Apache Spark Implementations for String Patterns in DNA Sequences. In Advances in Experimental Medicine and Biology (Vol. 1194, pp. 439–453). Springer. https://doi.org/10.1007/978-3-030-32622-7_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free