Matchtigs: minimum plain text representation of k-mer sets
We propose a polynomial algorithm computing a minimum plain-text representation of k-mer sets, as well as an efficient near-minimum greedy heuristic. When compressing read sets of large model organisms or bacteri...
Source: Genome Biology - Category: Genetics & Stem Cells Authors: Sebastian Schmidt, Shahbaz Khan, Jarno N. Alanko, Giulio E. Pibiri and Alexandru I. Tomescu Tags: Method Source Type: research