Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537)

From MaRDI portal
Revision as of 02:03, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dmaa/Torres-JimenezI17, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6794905
Language Label Description Also known as
English
Near-optimal algorithm to count occurrences of subsequences of a given length
scientific article; zbMATH DE number 6794905

    Statements

    title
    Near-optimal algorithm to count occurrences of subsequences of a given length (English)
    0 references
    author
    Jose Torres-Jimenez
    0 references
    Daniel Ramirez-Acuna
    0 references
    René Peralta
    0 references
    publication date
    20 October 2017
    0 references
    zbMATH Keywords
    counting subsequences
    0 references
    perfect tree
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W32
    0 references
    68R05
    0 references
    68W40
    0 references
    zbMATH DE Number
    6794905
    0 references
    Wikidata QID
    Q47663982
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5367537&oldid=37912821"
    Powered by MediaWiki