Related Experiment Video
Updated: Aug 12, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
Optimal sequence alignment allowing for long gaps
1Department of Biochemistry, Saitama Cancer Research Institute, Japan.
Abstract:
A new algorithm for optimal sequence alignment allowing for long insertions and deletions is developed. The algorithm requires O((L+C)MN) computational steps, O(LN) primary memory and O(MN) secondary memory storage, where M and N(M greater than or equal to N) are sequence lengths, L(typically L less than or greater than 3) is the number of segment specifying the gap weighting function, and C is a constant. We have also modified our earlier traceback algorithm so that it finds all and and only the optimal alignments in a compact form of a directed graph. The current versions accept a set of aligned sequences as input, which facilitates multiple sequence alignment by some iterative procedures.
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
Long-patch Base Excision Repair
Leaky Scanning
Evolutionary Relationships through Genome Comparisons
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...
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...