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.
Constructing Sequence Alignments from a Markov Decision Model with Estimated Parameter Values
Published
Author(s)
Fern Y. Hunt, Anthony J. Kearsley, Agnes A. O'Gallagher
Abstract
Current methods for aligning biological sequences are based on dynamic programming algorithms. If large numbers of sequences or a number of long ones are to be aligned the required computations are expensive in memory and CPU time. In an attempt to bring the tools of large scale linear programming (LP) methods to bear on this problem, we formulate the alignment process as a controlled Markov chain and construct a suggested alignment based on policies that minimize the expected total cost of the alignment.
Proceedings Title
2003 Proceedings of the Biological Language Conference, Pittsburgh, PA, Nov. 20-21, 2003
and Applied Bioinformatics
Hunt, F.
, Kearsley, A.
and O'Gallagher, A.
(2004),
Constructing Sequence Alignments from a Markov Decision Model with Estimated Parameter Values, 2003 Proceedings of the Biological Language Conference, Pittsburgh, PA, Nov. 20-21, 2003
and Applied Bioinformatics, Pittsburgh, PA, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51306
(Accessed October 1, 2025)