Sign in
A Unified Integer Programming Model for Genome Rearrangement Problems
Book chapter   Peer reviewed

A Unified Integer Programming Model for Genome Rearrangement Problems

Giuseppe Lancia, Franca Rinaldi and Paolo Serafini
Bioinformatics and Biomedical Engineering, pp.491-502
Lecture Notes in Computer Science, Springer International Publishing
2015

Abstract

Evolutionary distance Genome rearrangements Pancake flipping problem Sorting by reversals Sorting by transpositions
We describe an integer programming (IP) model that can be applied to the solution of all genome-rearrangement problems in the literature. No direct IP model for such problems had ever been proposed prior to this work. Our model employs an exponential number of variables, but it can be solved by column generation techniques. I.e., we start with a small number of variables and we show how the correct missing variables can be added to the model in polynomial time.

Metrics

3 Record Views

Details