Guillaume Marçais

J. Comput. Biol., December, 2023

Sketching methods with small window guarantee using minimum decycling sets.

[BibT_eX]

[DOI]

Dan F. DeBlasio

CoRR, 2023

2021

Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length.

[BibT_eX]

[DOI]

J. Comput. Biol., 2021

Harvestman: a framework for hierarchical feature learning and selection from whole genome sequencing data.

[BibT_eX]

[DOI]

Christopher J. Langmead

BMC Bioinform., 2021

Sequence-specific minimizers via polar sets.

[BibT_eX]

[DOI]

Bioinform., 2021

2020

Improved design and analysis of practical minimizers.

[BibT_eX]

[DOI]

Bioinform., 2020

2019

Locality-sensitive hashing for the edit distance.

[BibT_eX]

[DOI]

Bioinform., 2019

Practical Universal k-mer Sets for Minimizer Schemes.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

2018

MUMmer4: A fast and versatile genome alignment system.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2018

Asymptotically optimal minimizers schemes.

[BibT_eX]

[DOI]

Dan F. DeBlasio

Bioinform., 2018

2017

Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2017

Improving the performance of minimizers and winnowing schemes.

[BibT_eX]

[DOI]

Bioinform., 2017

2016

Compact Universal k-mer Hitting Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

2013

The MaSuRCA genome assembler.

[BibT_eX]

[DOI]

Bioinform., 2013

2012

Parsimonious reconstruction of network evolution.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2012

2011

Genome Assembly Techniques.

[BibT_eX]

[DOI]

PhD thesis, 2011

A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i>-mers.

[BibT_eX]

[DOI]