This chapter deals with some combinatorial optimization problems arising in computational biology. We first survey the assessment of the evolutionary distance between two genomes. The problem is equivalent to packing the edges of a bi-colored graph into a maximum number of alternating cycles, which naturally leads to an exponential-size ILP model. We then turn to the study of a particular type of bipartite matching, called alignment. Alignments are used to compare either protein sequences or protein 3-dimensional structures. We describe two exponential-size models for this type of comparisons and their compact extended reformulation.
Computational Biology Problems
Lancia G.;Serafini P.
2018-01-01
Abstract
This chapter deals with some combinatorial optimization problems arising in computational biology. We first survey the assessment of the evolutionary distance between two genomes. The problem is equivalent to packing the edges of a bi-colored graph into a maximum number of alternating cycles, which naturally leads to an exponential-size ILP model. We then turn to the study of a particular type of bipartite matching, called alignment. Alignments are used to compare either protein sequences or protein 3-dimensional structures. We describe two exponential-size models for this type of comparisons and their compact extended reformulation.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
