Complexity Analysis of Algorithms: A case study on Bioinformatics Tools

Adonney Allan de Oliveira Veras

Abstract


The data volume produced by the omic sciences nowadays was driven by the adoption of new generation sequencing platforms, popularly called NGS (Next Generation Sequencing). Among the analysis performed with this data, we can mention: mapping, genome assembly, genome annotation, pangenomic analysis, quality control, redundancy removal, among others. When it comes to redundancy removal analysis, it is worth noting the existence of several tools that perform this task, with proven accuracy through their scientific publications, but they lack criteria related to algorithmic complexity. Thus, this work aims to perform an algorithmic complexity analysis in computational tools for removing redundancy of raw reads from the DNA sequencing process, through empirical analysis. The analysis was performed with sixteen raw reads datasets. The datasets were processed with the following tools: MarDRe, NGSReadsTreatment, ParDRe, FastUniq, and BioSeqZip, and analyzed using the R statistical platform, through the GuessCompx package. The results demonstrate that the BioSeqZip and ParDRe tools present less complexity in this analysis

Keywords


Time complexity; Computational tools; Empirical analysis.

Refbacks

  • There are currently no refbacks.




Copyright (c) 2021 Adonney Allan de Oliveira Veras

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Print ISSN: 2522-6746 ,  Online ISSN: 2522-6754

SCIENTIFIC PRESS (SMC-PRIVATE) LIMITED