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

DOI10.1007/978-3-030-80049-9_15MaRDI QIDQ2117779zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On the complexity of sequence to graph alignment
• Mining preserving structures in a graph sequence
• Mining preserving structures in a graph sequence
• Describing the local structure of sequence graphs
• Walk-based transfinite graphs and networks
• A generic framework for computing parameters of sequence-based dynamic graphs
• Multiple sequence comparison and consistency on multipartite graphs
• Matrix Approach to Graph Transformation: Matching and Sequences
• Sequence graph transform (SGT): a feature embedding function for sequence data mining

Cites work

• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• An Eulerian path approach to DNA fragment assembly
• 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
• Reducibility among combinatorial problems

Cited in

(1)

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

Describes a project that uses

Uses Software

• vg
• GitHub
• GraphAligner

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

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