#42 Spectrum-preserving string sets and simplitigs with Amatur Rahman and Karel Břinda

<p>In this episode, we hear from <a href="https://orcid.org/0000-0002-9166-1220">Amatur Rahman</a> and <a href="https://scholar.harvard.edu/brinda">Karel Břinda</a>, who independently of one another released preprints on the same concept, called simplitigs or spectrum-preserving string sets. Simplitigs offer a way to efficiently store and query large sets of k-mers—or, equivalently, large de Bruijn graphs.</p> <p>Links:</p> <ul> <li><a href="https://www.biorxiv.org/content/10.1101/2020.01.12.903443v2">Simplitigs as an efficient and scalable representation of de Bruijn graphs</a> (Karel Břinda, Michael Baym, Gregory Kucherov)</li> <li><a href="https://www.biorxiv.org/content/10.1101/2020.01.07.896928v2">Representation of k-mer sets using spectrum-preserving string sets</a> (Amatur Rahman, Paul Medvedev)</li> <li><a href="https://bioinformatics.chat/openmic">Open mic</a></li> </ul>