For converting GFAs with overlapped sequences into blunt-ended GFAs with no overlaps.
Overlaps are resolved using POA, as in the following diagram:
The way that we resolve overlaps is designed to provide two guarantees. First, all two-hop adjacencies are preserved (i.e. if A > B > C is a walk in the input, that walk will be preserved in the output). This is the extent of adjacency information described in the link lines of the GFA. Second, no single-hop adjacencies are created that are not present in the input. False single-hop adjacencies are a risk when merged overlapped sequences in adjacency components are not fully connected (case C). To accomplish these two goals, it is sometimes necessary to duplicate portions of input sequences in the output. A table describing the provenance of the output sequences can optionally be produced alongside the output GFA.
./get_blunted [-p provenance_table.txt] -i input.gfa > bluntified.gfa
For a typical phased human assembly GFA (5.1GB) about 8GB of RAM are used, and run time is 1m 30s.
GetBlunted is compatible with Ubuntu (tested on 18.04 and 20.04), MacOS (tested on 10.14.6), and CentOS (tested on 7-8.2003.0.el7.centos.x86_64)
External dependencies: libomp, cmake
- Clone the repo and
cd GetBlunted/ mkdir buildcd buildcmake ..make -j [n_threads] install
The executable is found in GetBlunted/bin/
Please cite using this publication: Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBlunted https://doi.org/10.1007/978-3-030-80049-9_15