2 papers
cs.DS2016
The minimal hitting set generation problem: algorithms and computation
Andrew Gainer-Dewar, Paola Vera-Licona
Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computati…
q-bio.BM2015
Geometric combinatorics and computational molecular biology: branching polytopes for RNA sequences
Elizabeth Drellich, Andrew Gainer-Dewar, Heather A. Harrington +3
Questions in computational molecular biology generate various discrete optimization problems, such as DNA sequence alignment and RNA secondary structure prediction. However, the op…