A survey of map** algorithms in the long-reads era

K Sahlin, T Baudeau, B Cazaux, C Marchet - Genome Biology, 2023 - Springer
It has been over a decade since the first publication of a method dedicated entirely to
map** long-reads. The distinctive characteristics of long reads resulted in methods …

[HTML][HTML] Efficient high-quality metagenome assembly from long accurate reads using minimizer-space de Bruijn graphs

G Benoit, S Raguideau, R James, AM Phillippy… - bioRxiv, 2023 - ncbi.nlm.nih.gov
We introduce a novel metagenomics assembler for high-accuracy long reads. Our approach,
implemented as metaMDBG, combines highly efficient de Bruijn graph assembly in …

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

MD Rumpf, M Alser, AE Gollwitzer, J Lindegger… - arxiv preprint arxiv …, 2023 - arxiv.org
Computational complexity is a key limitation of genomic analyses. Thus, over the last 30
years, researchers have proposed numerous fast heuristic methods that provide …

Seedability: optimizing alignment parameters for sensitive sequence comparison

LAK Ayad, R Chikhi, SP Pissis - Bioinformatics Advances, 2023 - academic.oup.com
Motivation Most sequence alignment techniques make use of exact k-mer hits, called seeds,
as anchors to optimize alignment speed. A large number of bioinformatics tools employing …