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 January 13, 2025)
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)
, , 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.Citation
Applied Mathematics Letters
Volume
16
Issue
5
Pub Type
Journals
Download Paper
Keywords
alignment, linear programming, sequencing
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created July 1, 2003, Updated February 19, 2017