Optimal Omnitig Listing for Safe and Complete Contig Assembly

DOI10.4230/LIPICS.CPM.2017.29MaRDI QIDQ5110895zbMATH OpenOpenAlexFDO

Authors Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu

Publication date 25 May 2020

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/7342/pdf/LIPIcs-CPM-2017-29.pdf/

zbMATH Keywords

edge-covering walkgenome assemblygraph algorithmstrong bridge

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Algorithms on strings (68W32) Genetics and epigenetics (92D10)

Recommendations

• Safe and complete contig assembly via omnitigs
• Global optimization for scaffolding and completing genome assemblies
• The contig assembly problem and its algorithmic solutions
• Safety and completeness in flow decompositions for RNA assembly
• scientific article; zbMATH DE number 956614
• Computational efficiency of intermolecular gene assembly

Cited in

(4)

• Safe and complete contig assembly via omnitigs
• Hypergraph covering problems motivated by genome assembly questions
• An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph
• When is string reconstruction using de Bruijn graphs hard?

This page was built for publication: Optimal Omnitig Listing for Safe and Complete Contig Assembly

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