Computer Security Resource Center

Computer Security Resource Center

Computer Security
Resource Center

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:
Journal Article (DOI)

Supplemental Material:
Preprint (pdf)

Topics

Security and Privacy
cryptography