A survey of map** algorithms in the long-reads era
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 …
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
We introduce a novel metagenomics assembler for high-accuracy long reads. Our approach,
implemented as metaMDBG, combines highly efficient de Bruijn graph assembly in …
implemented as metaMDBG, combines highly efficient de Bruijn graph assembly in …
SequenceLab: A Comprehensive Benchmark of Computational Methods for Comparing Genomic Sequences
Computational complexity is a key limitation of genomic analyses. Thus, over the last 30
years, researchers have proposed numerous fast heuristic methods that provide …
years, researchers have proposed numerous fast heuristic methods that provide …
Seedability: optimizing alignment parameters for sensitive sequence comparison
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 …
as anchors to optimize alignment speed. A large number of bioinformatics tools employing …