The problem of multiple sequence alignment is recast as an optimization problem using Markov decision theory. One seeks to minimize the expected or average cost of alignment subject to data-derived constraints. In this setting the problem is equivalent to a linear program which can be solved efficiently using modern interior-point methods.
Citation: Applied Mathematics Letters
Pub Type: Journals
alignment, linear programming, sequencing