Skip to main content

2 Result(s)

within Discrete Mathematics in Computer Science Remove this filter Guillaume Marçais Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Compact Universal k-mer Hitting Sets

    We address the problem of finding a minimum-size set of k-mers that hits L-long sequences. The problem arises in the design of compact hash functions and other data structures for efficient handling of large sequ...

    Yaron Orenstein, David Pellow, Guillaume Marçais… in Algorithms in Bioinformatics (2016)

  2. No Access

    Chapter and Conference Paper

    Parsimonious Reconstruction of Network Evolution

    We consider the problem of reconstructing a maximally parsimonious history of network evolution under models that support gene duplication and loss and independent interaction gain and loss. We introduce a com...

    Rob Patro, Emre Sefer, Justin Malin, Guillaume Marçais… in Algorithms in Bioinformatics (2011)