Publications
* Shared first-author contribution. † Joint senior authorship.
Preprints
Why phylogenies compress so well: combinatorial guarantees under the infinite sites model.
bioRxiv 2026.03.18.712055, 2026.
Pareto optimization of masked superstrings improves compression of pan-genome k-mer sets.
bioRxiv 2026.03.18.712440, 2026.
Novel genes arise from genomic deletions across the bacterial tree of life.
bioRxiv 2026.01.05.697752, 2026.
Optimized k-mer search across millions of bacterial genomes on laptops.
bioRxiv 2025.11.23.690050, 2025.
bioRxiv 2025.09.03.673989, 2025.
Journal Articles
Bioinformatics Advances 6(1), vbaf290, 2026.
Antimicrobial Agents and Chemotherapy, e01071-25, 2026.
Efficient and robust search of microbial genomes via phylogenetic compression.
Nature Methods 22, 692–697, 2025.
Microbiology Spectrum 13(1), e01366-24, 2025.
Science Advances 8(4), 2022.
Microbiome 10(1), 2022.
Simplitigs as an efficient and scalable representation of de Bruijn graphs.
Genome Biology 22(96), 2021.
Proceedings of the National Academy of Sciences 118(6), 2021.
BMC Medicine 19(162), 2021.
Rapid inference of antibiotic resistance and susceptibility by Genomic Neighbour Typing.
Nature Microbiology 5, 455–464, 2020.
Antimicrobial Agents and Chemotherapy 64(5), 2020.
Bioconda: sustainable and comprehensive software distribution for the life sciences.
Nature Methods 15(7), 475–476, 2018.
RNF: a general framework to evaluate NGS read mappers.
Bioinformatics 32(1), 136–139, 2016.
Spaced seeds improve k-mer-based metagenomic classification.
Bioinformatics 31(22), 3584–3592, 2015.
Fundamenta Informaticae 132(1), 33–61, 2014.
Abelian complexity of infinite words associated with quadratic Parry numbers.
Theoretical Computer Science 412(45), 6252–6260, 2011.
Peer-Reviewed Conference Articles
Towards efficient k-mer set operations via function-assigned masked superstrings.
In Proceedings of the Prague Stringology Conference 2025 (PSC 2025), pp. 26–40, 2025. Available from bioRxiv 2024.03.06.583483.
Masked superstrings as a unified framework for textual k-mer set representations.
RECOMB-Seq 2023, 2023. Available from bioRxiv 2023.02.01.526717.
Blind friendly maps: tactile maps for the blind as a part of the public map portal (mapy.cz).
In Proceedings of 15th International Conference on Computers Helping People with Special Needs (ICCHP 2016), Lecture Notes in Computer Science 9759, pp. 131–138, 2016.
In Proceedings of 14th International Conference on Automata and Formal Languages (AFL 2014), Electronic Proceedings in Theoretical Computer Science 151, pp. 139–150, 2014.
Technical Reports
Ococo: an online variant and consensus caller.
arXiv 1712.01146 [q-bio.GN], 2018.
Dynamic read mapping and online consensus calling for better variant detection.
arXiv 1605.09070 [q-bio.GN], 2016.
Patents
Rapid identification of strains from sequence data.
United States Patent Application 17/251,343, US 2021/0246502 A1, 2021.
Theses
Novel computational techniques for mapping and classification of Next-Generation Sequencing data.
PhD thesis, University of Paris-Est, 2016.
Lossless seeds for approximate string matching.
MSc thesis, Czech Technical University, 2013.
Abelian complexity of infinite words.
BSc thesis, Czech Technical University, 2011.