How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.
Sébastien AngibaudGuillaume FertinIrena RusuStéphane VialettePublished in: Comparative Genomics (2006)
Keyphrases
- distance computation
- pseudo boolean
- integer linear programming
- distance function
- combinatorial problems
- similarity search
- feature construction
- nearest neighbor
- similarity measure
- multi step
- edit distance
- sequence data
- programming language
- euclidean distance
- exact solution
- k nearest neighbor
- dimensionality reduction
- symmetry breaking
- propositional satisfiability
- neural network
- logic programs
- high dimensional
- nearest neighbor search
- logic programming
- locality sensitive hashing
- constraint programming
- pairwise
- data structure
- metaheuristic
- multi dimensional