Expand description
A library containing the matchtigs algorithms. Use this to compute pathtigs (similar to simplitigs and UST-tigs), greedy matchtigs and matchtigs for arbitrary graph types.
Modules§
- clib
- Bindings of our algorithms for the C language.
Structs§
- Eulertig
Algorithm - The eulertigs algorithm.
- Eulertig
Algorithm Configuration - The options for the eulertigs algorithm.
- Greedytig
Algorithm - The greedy matchtigs algorithm.
- Greedytig
Algorithm Configuration - The options for the greedy matchtigs algorithm.
- Matchtig
Algorithm - The matchtigs algorithm.
- Matchtig
Algorithm Configuration - The options for the matchtigs algorithm.
- Pathtig
Algorithm - The pathtig algorithm computes a heuristically small set of edge-disjoint paths, similar to simplitigs and UST-tigs. This algorithm does not alter the graph.
Enums§
- Heap
Type - The heap data structure used by Dijkstra’s algorithm.
- Node
Weight Array Type - The type of the data structure to store the weight of visited nodes in Dijkstra’s algorithm.
Traits§
- Matchtig
Edge Data - The edge data of the graph to compute matchtigs on has to implement this.
- TigAlgorithm
- An algorithm to compute tigs for a graph.
Functions§
- write_
duplication_ bitvector - Write a bitvector in ASCII format for each walk. The bitvector contains a 1 for each original kmer, and a 0 for each duplicate kmer. The bitvectors of different walks are separated by newlines.
- write_
duplication_ bitvector_ to_ file - Convenience method for write_duplication_bitvector.