SAMA: a contig assembler with correctness guarantee
The paper introduces a contig assembler that provides correctness guarantees by modeling misassembly probabilities in de Bruijn graph assemblies.
Author
University of HelsinkiORCID 0000-0002-0756-543XUnclaimed ORCID profile · follow to get notified of new preprints
7 papers
Recent·Most cited
The paper introduces a contig assembler that provides correctness guarantees by modeling misassembly probabilities in de Bruijn graph assemblies.
Jun Ma, Manuel Cáceres, Leena Salmela…·Alexandru Ioan Tomescu
GraphChainer improves alignment of erroneous long reads to acyclic variation graphs, aligning more reads and total read length than existing tools.
Diego Diaz-Domínguez, Pierfrancesco Martinello, Taku Onodera…·Leena Salmela
This paper defines contigs for variable-order de Bruijn graphs and presents an algorithm to improve genome assembly contiguity using PacBio HiFi data.
Bahar Alipanahi, Alan Kuhnle, Simon J. Puglisi…·Christina A. Boucher
This paper introduces DynamicBOSS, a succinct dynamic de Bruijn graph representation that supports unlimited additions and deletions of nodes and edges, outperforming existing methods for large-scale datasets.
Kingshuk Mukherjee, Darshan Washimkar, Martin D. Muggli…·Christina A. Boucher
The paper introduces cOMet, an error correction method for optical mapping data, which improves the accuracy of Rmap data and enhances genome assembly quality.
Alexandre P. Francisco, Travis Gagie, Dominik Kempa…·Esko Ukkonen
The paper compares finite-state machines and position weight matrices for modeling sequence motifs, finding FSMs provide better discrimination of positive and negative sequences.