Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted

DOI10.1007/978-3-030-80049-9_15OpenAlexW3183022517MaRDI QIDQ2117779

Benedict Paten, Jordan M. Eizenga, Melissa M. Meredith, Ryan Lorig-Roach

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_15

zbMATH Keywords

genome assemblygraph genomepangenomics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Computational graph pangenomics: a tutorial on data structures and their applications

Uses Software

• GitHub
• vg
• GraphAligner

Cites Work

• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
• On the complexity of sequence to graph alignment
• An Eulerian path approach to DNA fragment assembly
• Reducibility among Combinatorial Problems
• Unnamed Item

This page was built for publication: Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted