The reviewed record of science sign in
Pith

arxiv: 2310.16908 · v5 · pith:BLXJ4HLF · submitted 2023-10-25 · q-bio.GN · cs.AR· q-bio.QM

SequenceLab: A Comprehensive Benchmark of Computational Methods for Comparing Genomic Sequences

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:BLXJ4HLFrecord.jsonopen to challenge →

classification q-bio.GN cs.ARq-bio.QM
keywords computationalgenomicmethodssequencesanalysiscomparingsequencelabanalyses
0
0 comments X
read the original abstract

Computational complexity is a key limitation of genomic analyses. Thus, over the last 30 years, researchers have proposed numerous fast heuristic methods that provide computational relief. Comparing genomic sequences is one of the most fundamental computational steps in most genomic analyses. Due to its high computational complexity, optimized exact and heuristic algorithms are still being developed. We find that these methods are highly sensitive to the underlying data, its quality, and various hyperparameters. Despite their wide use, no in-depth analysis has been performed, potentially falsely discarding genetic sequences from further analysis and unnecessarily inflating computational costs. We provide the first analysis and benchmark of this heterogeneity. We deliver an actionable overview of the 11 most widely used state-of-the-art methods for comparing genomic sequences. We also inform readers about their advantages and downsides using thorough experimental evaluation and different real datasets from all major manufacturers (i.e., Illumina, ONT, and PacBio). SequenceLab is publicly available at https://github.com/CMU-SAFARI/SequenceLab.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.