Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
From MaRDI portal
Publication:2117779
DOI10.1007/978-3-030-80049-9_15OpenAlexW3183022517MaRDI QIDQ2117779FDOQ2117779
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
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
- Reducibility among Combinatorial Problems
- Title not available (Why is that?)
- 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
Cited In (1)
Uses Software
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)
