U.S. flag   An unofficial archive of your favorite United States government website
Dot gov

Official websites do not use .rip
We are an unofficial archive, replace .rip by .gov in the URL to access the official website. Access our document index here.

Https

We are building a provable archive!
A lock (Dot gov) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)

Journal Article

Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length

Published: June 21, 2017
Citation: Discrete Mathematics, Algorithms and Applications vol. 9, no. 3, (June 2017)

Author(s)

Jose Torres-Jimenez (CINVESTAV-Tamaulipas), Idelfonso Izquierdo-Marquez (CINVESTAV-Tamaulipas), Daniel Ramirez-Acuna (CINVESTAV-Tamaulipas), Rene Peralta (NIST)

Abstract

Keywords

counting subsequences; perfect tree
Control Families

None selected

Documentation

Publication:
https://doi.org/10.1142/S1793830917500422

Supplemental Material:
Preprint (pdf)

Document History:
06/21/17: Journal Article (Final)

Topics

Security and Privacy

cryptography