pub fn linear(matches: &ArgMatches) -> Result<()>
Expand description

Force a linear representation of the GFA.

This function finds all legal paths through a GFA, and returns the longest path, with the highest cumulative edge coverage.

If the -i option is included, node coverages are taken into account, and paths are created with nodes appearing in the final path the number of times they relatively occur according to coverage information.

For example:

# simple
gfatk linear in.gfa > out.fasta
# account for node coverage
gfatk -i linear in.gfa > out.fasta