Guillaume Marcais, Ph.D.

Affiliations: 
2011 Applied Mathematics and Scientific Computation University of Maryland, College Park, College Park, MD 
Google:
"Guillaume Marcais"
Mean distance: 17.95
 
SNBCP

Parents

Sign in to add mentor
James Yorke grad student 2011 University of Maryland
 (Genome assembly techniques.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Marçais G, DeBlasio D, Kingsford C. (2023) Sketching methods with small window guarantee using minimum decycling sets. Arxiv
Zheng H, Marçais G, Kingsford C. (2023) Creating and Using Minimizer Sketches in Computational Genomics. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
Mongia M, Shen C, Davoodi AG, et al. (2023) Large scale sequence alignment via efficient inference in generative models. Scientific Reports. 13: 7285
Zheng H, Kingsford C, Marçais G. (2021) Sequence-specific minimizers via polar sets. Bioinformatics (Oxford, England). 37: i187-i195
Frisby TS, Baker SJ, Marçais G, et al. (2021) HARVESTMAN: a framework for hierarchical feature learning and selection from whole genome sequencing data. Bmc Bioinformatics. 22: 174
Marçais G, DeBlasio D, Pandey P, et al. (2019) Locality-sensitive hashing for the edit distance. Bioinformatics (Oxford, England). 35: i127-i135
Marçais G, Solomon B, Patro R, et al. (2019) Sketching and Sublinear Data Structures in Genomics Annual Review of Biomedical Data Science. 2: 93-118
Marçais G, Delcher AL, Phillippy AM, et al. (2018) MUMmer4: A fast and versatile genome alignment system. Plos Computational Biology. 14: e1005944
Orenstein Y, Pellow D, Marçais G, et al. (2017) Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing. Plos Computational Biology. 13: e1005777
Marçais G, Pellow D, Bork D, et al. (2017) Improving the performance of minimizers and winnowing schemes. Bioinformatics (Oxford, England). 33: i110-i117
See more...