DeepMinimizer: a differentiable framework for optimizing sequence-specific minimizer schemes

DOI10.1007/978-3-031-04749-7_4MaRDI QIDQ2170124zbMATH OpenOpenAlexFDO

Authors Hongyu Zheng, Carl Kingsford, Minh A. Hoang

Publication date 30 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-04749-7_4

zbMATH Keywords

optimizationdeep learningsequence sketching

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Protein sequences, DNA sequences (92D20)

Recommendations

• Fast approximation of frequent \(k\)-mers and applications to metagenomics
• Optimizing Read Reversals for Sequence Compression
• Edge minimization in de Bruijn graphs
• A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets
• Scaling metagenome sequence assembly with probabilistic de Bruijn graphs

Cites work

• A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets

Cited in

(3)

• Min-based possibilisticDL-Lite
• The deep minimizing movement scheme
• Fractional hitting sets for efficient and lightweight genomic data sketching

Describes a project that uses

Uses Software

• Winnowing
• Minimap2
• Adam
• KMC
• Gerbil

This page was built for publication: DeepMinimizer: a differentiable framework for optimizing sequence-specific minimizer schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170124)