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 bacterial pangenomes, with only a minor runtime increase, we shrink the representation by up to...

Descripción completa

Detalles Bibliográficos
Autores principales: Schmidt, Sebastian, Khan, Shahbaz, Alanko, Jarno N., Pibiri, Giulio E., Tomescu, Alexandru I.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2023
Materias:
Method
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10251615/
https://www.ncbi.nlm.nih.gov/pubmed/37296461
http://dx.doi.org/10.1186/s13059-023-02968-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10251615/
https://www.ncbi.nlm.nih.gov/pubmed/37296461
http://dx.doi.org/10.1186/s13059-023-02968-z

Ejemplares similares