Related Experiment Video
Updated: Jul 28, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
A sequence alignment algorithm with an arbitrary gap penalty function
1Keck Graduate Institute of Applied Life Science, 535 Watson Drive, Claremont, CA 91711, USA. Greg_Dewey@Kgi.edu
Abstract:
An algorithm for aligning biological sequences is presented that is an adaptation of the sequence generating function approach used in the statistical mechanics of biopolymers. This algorithm uses recursion relationships developed from a partition function formalism of alignment probabilities. It is implemented within a dynamic programming format that closely resembles the forward algorithm used in hidden Markov models (HMM). The algorithm aligns sequences or structures according to the statistically dominant alignment path and will be referred to as the SDP algorithm. An advantage of this method over previous ones is that it allows more complicated and physically realistic gap penalty functions to be incorporated into the algorithm in a facile manner. The performance of this algorithm in a case study of aligning the heavy and light chain from the variable region of an immunoglobulin is investigated.
More Related Videos
07:08Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
Published on: July 14, 2015
07:49Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
Published on: August 16, 2017
Related Concept Videos
Mismatch Repair
Long-patch Base Excision Repair
Evolutionary Relationships through Genome Comparisons
RACE - Rapid Amplification of cDNA Ends
Since the...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Mismatch Repair
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...