NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
An Optimization Approach to Multiple Sequence Alignment
Published
Author(s)
Fern Y. Hunt, Anthony J. Kearsley, H H Wan
Abstract
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.
Hunt, F.
, Kearsley, A.
and , H.
(2003),
An Optimization Approach to Multiple Sequence Alignment, Applied Mathematics Letters, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=150843
(Accessed October 13, 2025)