The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees (Q3590985)

From MaRDI portal
Revision as of 09:54, 13 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
scientific article

    Statements

    The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees (English)
    0 references
    0 references
    3 September 2007
    0 references

    Identifiers