Sebastian Schmidt

The paper introduces a linear-time algorithm to compute ultrabubbles in bidirected pangenome graphs, achieving significant speedups over existing methods.

This paper introduces flowtigs, a characterization of safe walks for flow decompositions in general graphs, and demonstrates their application to improve metagenomic assembly contiguity.

The paper introduces an algorithm to compute a minimum plain text representation of k-mer sets without repetitions in linear time and evaluates existing heuristics.

The paper improves genome assembly contiguity by integrating the omnitig framework into existing assemblers using simplified algorithms, showing better alignment-based contiguity with minimal computational cost.

The paper introduces Matchtigs, a method to compress kmer sets with a polynomial algorithm and greedy heuristic, achieving significant size reduction and performance improvements in downstream applications.