Applying the safe-and-complete framework to practical genome assembly

DOI10.4230/LIPICS.WABI.2024.8MaRDI QIDQ6857987zbMATH OpenFDO

Authors Sebastian M. Schmidt, Santeri Toivonen, Paul Medvedev, Alexandru I. Tomescu

Publication date 13 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.WABI.2024.8

zbMATH Keywords

graph algorithmgenome assemblyomnitigsassembly evaluationHiFi sequencing datasafe-and-complete framework

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to biology (92-08)

Cites work

• An Eulerian path approach to DNA fragment assembly
• An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph
• Cut paths and their remainder structure, with applications
• Genome assembly, from practice to theory: safe, complete and \textit{linear-time}
• Genome-Scale Algorithm Design
• Strong connectivity in directed graphs under failures, with applications

This page was built for publication: Applying the safe-and-complete framework to practical genome assembly

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