Computing all subtree repeats in ordered trees (Q1941702)

From MaRDI portal
Revision as of 01:14, 21 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q61677867, #quickstatements; #temporary_batch_1710979808849)
scientific article
Language Label Description Also known as
English
Computing all subtree repeats in ordered trees
scientific article

    Statements

    title
    Computing all subtree repeats in ordered trees (English)
    0 references
    author
    Michalis Christou
    0 references
    Maxime Crochemore
    0 references
    Tomáš Flouri
    0 references
    Costas S. Iliopoulos
    0 references
    Jan Janoušek
    0 references
    Bořivoj Melichar
    0 references
    Solon P. Pissis
    0 references
    publication date
    21 March 2013
    0 references
    zbMATH Keywords
    trees
    0 references
    strings
    0 references
    subtree repeats
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W32
    0 references
    05C05
    0 references
    68R15
    0 references
    zbMATH DE Number
    6147769
    0 references
    OpenAlex ID
    W2146620962
    0 references
    Wikidata QID
    Q61677867
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1941702&oldid=33097896"
    Powered by MediaWiki