Related Experiment Video
Updated: Feb 21, 2026

Novel Sequence Discovery by Subtractive Genomics
Published on: January 25, 2019
A Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length
Jose Torres-Jimenez1, Idelfonso Izquierdo-Marquez1, Daniel Ramirez-Acuna1
1CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., México.
Abstract:
For k ∈ ℤ+, define Σ k as the set of integers {0, 1, …, k - 1}. Given an integer n and a string t of length m ≥ n over Σ k , we count the number of times that each one of the kn distinct strings of length n over Σ k occurs as a subsequence of t. Our algorithm makes only one scan of t and solves the problem in time complexity mkn-1 and space complexity m + kn . These are very close to best possible.
Related Concept Videos
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Arithmetic Sequences
Sequences
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...
Wald-Wolfowitz Runs Test I
The test works...
Determination of Expected Frequency

