Safe and Complete Contig Assembly Via Omnitigs

DOI10.1007/978-3-319-31957-5_11zbMath1355.92070arXiv1601.02932OpenAlexW2962692351MaRDI QIDQ2814598

Paul Medvedev, Alexandru I. Tomescu

Publication date: 22 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.02932

zbMATH Keywords

assemblersgenome graphcontig assemblyomnitigs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items

Safety and completeness in flow decompositions for RNA assembly, Simplicity in Eulerian circuits: uniqueness and safety, An investigation to test spectral segments as bacterial biomarkers, Unnamed Item, Safe and Complete Contig Assembly Via Omnitigs, Safety in \(s\)-\(t\) paths, trails and walks

Uses Software

• GAGE
• SPAdes
• Velvet
• SOAPdenovo
• BESST

Cites Work

• Combinatorial algorithms for DNA sequence assembly
• Gap Filling as Exact Path Length Problem
• Safe and Complete Contig Assembly Via Omnitigs
• An Eulerian path approach to DNA fragment assembly
• Information Theory of DNA Shotgun Sequencing