Optimal Omnitig Listing for Safe and Complete Contig Assembly

DOI10.4230/LIPIcs.CPM.2017.29zbMath1434.68726OpenAlexW2752602978MaRDI QIDQ5110895

Massimo Cairo, Nidia Obscura Acosta, Romeo Rizzi, Paul Medvedev, 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

graph algorithmgenome assemblystrong bridgeedge-covering walk

Mathematics Subject Classification ID

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

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