List view

• Integrate wtdbg2

  wtdbg2 creates a fuzzy de Bruijn graph from long reads. It only uses unitigs, so we want to check what happens if we give it omnitigs.

  No due date

  •8/10 issues closed
  80% complete2 open8 closed

• Preprocess HamCycle Instances

  Compute the node-centric omnitigs in Hamiltonian Cycle instances and use them to deny instances or to contract the graph and hopefully speed up solvers this way.

  No due date

  •7/7 issues closed
  100% complete0 open7 closed

• Milestone A pipeline

  Implement required commands and integrate required software tools.

  No due date

  •21/24 issues closed
  87% complete3 open21 closed

• Compute omnitigs

  Implement an O(mn) macrotig-based omnitig algorithm that does not use Italiano.

  No due date

  •16/16 issues closed
  100% complete0 open16 closed

• Connectivity checks and resolution

  Check if the input graph is strongly connected, or consists of maximal weakly connected components that are strongly connected. For this milestone, it is enough to implement the check in the `verify` command.

  No due date

  •4/7 issues closed
  57% complete3 open4 closed