Paper
6 November 2019 The efficient algorithm for mapping next generation sequencing reads to reference genome
Author Affiliations +
Proceedings Volume 11176, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019; 111761W (2019) https://doi.org/10.1117/12.2536653
Event: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019, 2019, Wilga, Poland
Abstract
One of the main problem related to genomics is finding similarities between different species represented by DNA sequences. The dynamic programming algorithms (Needleman-Wunsch, Smith-Waterman) give a good measure of similarity, but are not efficient for big data sets. In this study we present the new heuristic algorithm based on common parts of reads. The approach can handle all types of sequencing errors: insertions, deletions and replacements. Our algorithm result is similar to other well known tools. The presented algorithm is implemented in C++, it uses Boost libraries, it internally use threads for parallel computing. This algorithm is a part of the DNA assembler ’dnaasm’. Source code, demo application and supplementary materials are available at project homepage: http://dnaasm.sourceforge.net.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Patryk Pankiewicz, Wiktor Kuśmirek, and Robert M. Nowak "The efficient algorithm for mapping next generation sequencing reads to reference genome", Proc. SPIE 11176, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019, 111761W (6 November 2019); https://doi.org/10.1117/12.2536653
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development

Associative arrays

C++

Computer science

Genetics

Computer programming

Genomics

Back to Top