Description

Apply different kind of sorting algorithms to a graph. The most prominent one is the PG-SGD sorting algorithm.

Input

name:type
description
pattern

meta

:map

Groovy Map containing sample information e.g. [ id:‘test’, single_end:false ]

graph

:file

Pangenome graph in GFA v1.0 format or in ODGI binary format

*.{gfa,og}

Output

name:type
description
pattern

sorted_graph

meta

:map

Groovy Map containing sample information e.g. [ id:‘test’, single_end:false ]

*.og

:file

1D sorted pangenome graph in ODGI binary format

*.{og}

versions_odgi

${task.process}

:string

The name of the process

odgi

:string

The name of the tool

odgi version | sed 's/^v//; s/-.*//'

:eval

The expression to obtain the version of the tool

Topics

name:type
description
pattern

versions

${task.process}

:string

The name of the process

odgi

:string

The name of the tool

odgi version | sed 's/^v//; s/-.*//'

:eval

The expression to obtain the version of the tool