Near real-time suffix tree construction via the fringe marked ancestor problem (Q2376800)

From MaRDI portal
Revision as of 16:41, 30 December 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jda/BreslauerI13, #quickstatements; #temporary_batch_1735573089131)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Near real-time suffix tree construction via the fringe marked ancestor problem
scientific article

    Statements

    title
    Near real-time suffix tree construction via the fringe marked ancestor problem (English)
    0 references
    author
    Giuseppe F. Italiano
    0 references
    Dany Breslauer
    0 references
    publication date
    24 June 2013
    0 references
    zbMATH Keywords
    string algorithms
    0 references
    suffix trees
    0 references

    Identifiers

    zbMATH DE Number
    6180277
    0 references
    Wikidata QID
    Q61609398
    0 references
    OpenAlex ID
    W1985059829
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2376800&oldid=39577966"
    Powered by MediaWiki