Related Experiment Video
Updated: May 18, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
Very efficient search for nucleotide alignments
1Department of Mathematics and Computer Science, Drake University, Des Moines, Iowa 50311, USA. mrandic@msn.com
Abstract:
We describe a very efficient search for nucleotide alignments, which is analogous to the novel very efficient search for protein alignment. Just as it has been the case with the alignment of proteins, based on 20 × 20 adjacency matrices for amino acids, obtained from a superposition of labeled amino acids adjacency matrices for the proteins considered, one can construct labeled matrices of size 4 × 4, listing adjacencies of nucleotides in DNA sequence. The matrix elements correspond to 16 pairs of adjacent nucleotides. To obtain DNA alignments, one combines information in the corresponding matrices for a pair of DNA nucleotides. Matrices are obtained by insertion of the sequential labels for pairs of nucleotides in the corresponding cells of the 4 × 4 tables. When two such matrices are superimposed, one can identify all segments in two DNA sequences, which are shifted relative to one another by the same amount in either direction, without using trial-and-error displacements of the two sequences one relative to the other to find local nucleotide alignments.
Related Concept Videos
Evolutionary Relationships through Genome Comparisons
Modern Molecular Taxonomy
Nucleic Acid Structure
DNA Structure
DNA has a double-helix structure. The...
Gene Evolution - Fast or Slow?
In contrast, regions which code...
Phylogenetic Trees
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...

