Related Experiment Video
Updated: Sep 28, 2026

BEST: Barcode Enabled Sequencing of Tetrads
Published on: May 1, 2014
Efficient Boolean implementation of universal sequence maps (bUSM)
John Schwacke1, Jonas S Almeida
1Department of Biometry and Epidemiology, Medical University of South Carolina, 135 Cannon Street, Suite 303, PO Box 250835, Charleston, SC 29425, USA. schwacke@musc.edu
Background:
Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed its applicability to genomic sequence analysis. Their work generalizes and extends Chaos Game Representation (CGR) of DNA for arbitrary discrete sequences.
Results:
We have considered issues associated with the practical implementation of USMs and offer a variation on the algorithm that: 1) eliminates the overestimation of similar segment lengths, 2) permits the identification of arbitrarily long similar segments in the context of finite word length coordinate representations, 3) uses more computationally efficient operations, and 4) provides a simple conversion for recovering the USM coordinates. Computational performance comparisons and examples are provided.
Conclusions:
We have shown that the desirable properties of the USM encoding of nucleotide sequences can be retained in a practical implementation of the algorithm. In addition, the proposed implementation enables determination of local sequence identity at increased speed.
Related Concept Videos
Per-Unit Sequence Models
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Convergence of Sequences
Sequences
Introduction to Sequences
Arithmetic Sequences
