Designing q-Unique DNA Sequences with Integer Linear Programs and Euler Tours in De Bruijn Graphs.
Marianna D'AddarioNils M. KriegeSven RahmannPublished in: GCB (2012)
Keyphrases
- dna sequences
- linear program
- motif discovery
- linear programming
- extreme points
- graph structure
- semi infinite
- simplex method
- stochastic programming
- primal dual
- tandem repeats
- human genome
- optimal solution
- objective function
- mixed integer linear program
- column generation
- dna sequencing
- coding regions
- dna computing
- np hard
- dynamic programming
- binding sites
- mixed integer
- integer program
- traveling salesman problem
- interior point methods
- biological sequences
- linear programming problems
- interior point
- strongly polynomial
- sequence patterns
- directed graph
- lower bound
- minimum cost flow
- special case
- linear inequalities
- geometric properties
- multistage