default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Marçais
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Guillaume Marçais
, Dan F. DeBlasio, Carl Kingsford:
Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets. J. Comput. Biol. 31(7): 597-615 (2024)- 2023
- [j13]Hongyu Zheng, Guillaume Marçais, Carl Kingsford:
Creating and Using Minimizer Sketches in Computational Genomics. J. Comput. Biol. 30(12): 1251-1276 (2023) - [i2]Guillaume Marçais, Dan F. DeBlasio, Carl Kingsford:
Sketching methods with small window guarantee using minimum decycling sets. CoRR abs/2311.03592 (2023) - 2021
- [j12]Hongyu Zheng, Carl Kingsford, Guillaume Marçais:
Sequence-specific minimizers via polar sets. Bioinform. 37(Supplement): 187-195 (2021) - [j11]Trevor S. Frisby, Shawn J. Baker, Guillaume Marçais, Quang Minh Hoang, Carl Kingsford, Christopher J. Langmead:
Harvestman: a framework for hierarchical feature learning and selection from whole genome sequencing data. BMC Bioinform. 22(1): 174 (2021) - [j10]Hongyu Zheng, Carl Kingsford, Guillaume Marçais:
Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length. J. Comput. Biol. 28(4): 395-409 (2021) - 2020
- [j9]Hongyu Zheng, Carl Kingsford, Guillaume Marçais:
Improved design and analysis of practical minimizers. Bioinform. 36(Supplement-1): i119-i127 (2020) - [c5]Hongyu Zheng, Carl Kingsford, Guillaume Marçais:
Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length. RECOMB 2020: 202-217 - [i1]Hongyu Zheng, Carl Kingsford, Guillaume Marçais:
Lower density selection schemes via small universal hitting sets with short remaining path length. CoRR abs/2001.06550 (2020)
2010 – 2019
- 2019
- [j8]Guillaume Marçais, Dan F. DeBlasio, Prashant Pandey, Carl Kingsford:
Locality-sensitive hashing for the edit distance. Bioinform. 35(14): i127-i135 (2019) - [c4]Dan F. DeBlasio, Fiyinfoluwa Gbosibo, Carl Kingsford, Guillaume Marçais:
Practical Universal k-mer Sets for Minimizer Schemes. BCB 2019: 167-176 - 2018
- [j7]Guillaume Marçais, Dan F. DeBlasio, Carl Kingsford:
Asymptotically optimal minimizers schemes. Bioinform. 34(13): i13-i22 (2018) - [j6]Guillaume Marçais, Arthur L. Delcher, Adam M. Phillippy, Rachel Coston, Steven L. Salzberg, Aleksey V. Zimin:
MUMmer4: A fast and versatile genome alignment system. PLoS Comput. Biol. 14(1) (2018) - 2017
- [j5]Guillaume Marçais, David Pellow, Daniel Bork, Yaron Orenstein, Ron Shamir, Carl Kingsford:
Improving the performance of minimizers and winnowing schemes. Bioinform. 33(14): i110-i117 (2017) - [j4]Yaron Orenstein, David Pellow, Guillaume Marçais, Ron Shamir, Carl Kingsford:
Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing. PLoS Comput. Biol. 13(10) (2017) - 2016
- [c3]Yaron Orenstein, David Pellow, Guillaume Marçais, Ron Shamir, Carl Kingsford:
Compact Universal k-mer Hitting Sets. WABI 2016: 257-268 - 2013
- [j3]Aleksey V. Zimin, Guillaume Marçais, Daniela Puiu, Michael Roberts, Steven L. Salzberg, James A. Yorke:
The MaSuRCA genome assembler. Bioinform. 29(21): 2669-2677 (2013) - 2012
- [j2]Rob Patro, Emre Sefer, Justin Malin, Guillaume Marçais, Saket Navlakha, Carl Kingsford:
Parsimonious reconstruction of network evolution. Algorithms Mol. Biol. 7: 25 (2012) - 2011
- [b1]Guillaume Marçais:
Genome Assembly Techniques. University of Maryland, College Park, MD, USA, 2011 - [j1]Guillaume Marçais, Carl Kingsford:
A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinform. 27(6): 764-770 (2011) - [c2]Rob Patro, Emre Sefer, Justin Malin, Guillaume Marçais, Saket Navlakha, Carl Kingsford:
Parsimonious Reconstruction of Network Evolution. WABI 2011: 237-249
2000 – 2009
- 2000
- [c1]Michel Courson, Alan Mink, Guillaume Marçais, Benjamin Traverse:
An Automated Benchmarking Toolset. HPCN Europe 2000: 497-506
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
