Related Experiment Video
Updated: Sep 25, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
Published on: July 14, 2015
Hidden Markov models and optimized sequence alignments
L Smith1, L Yeganova, W J Wilbur
1Computational Biology Branch, National Center for Biotechnology Information, National Library of Medicine, Rm. 614D, Bldg. 38A, 8600 Rockville Pike, Bethesda, MD 20894, USA. lsmith@ncbi.nlm.nih.gov
Abstract:
We present a formulation of the Needleman-Wunsch type algorithm for sequence alignment in which the mutation matrix is allowed to vary under the control of a hidden Markov process. The fully trainable model is applied to two problems in bioinformatics: the recognition of related gene/protein names and the alignment and scoring of homologous proteins.
Related Concept Videos
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Molecular Models

