Markov approximation and consistent estimation of unbounded probabilistic suffix trees (Q870475)

From MaRDI portal
Revision as of 06:17, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Markov approximation and consistent estimation of unbounded probabilistic suffix trees
scientific article

    Statements

    Markov approximation and consistent estimation of unbounded probabilistic suffix trees (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2007
    0 references
    variable length Markov chains
    0 references
    algorithm context
    0 references

    Identifiers