Computing all subtree repeats in ordered trees (Q1941702): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61677867, #quickstatements; #temporary_batch_1710979808849 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Variations on the Common Subexpression Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tree automata for code selection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finding common subtrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Programming with Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5581665 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for pattern matching and discovery in RNA secondary structure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arbology: Trees and Pushdown Automata / rank | |||
Normal rank |
Revision as of 06:57, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing all subtree repeats in ordered trees |
scientific article |
Statements
Computing all subtree repeats in ordered trees (English)
0 references
21 March 2013
0 references
trees
0 references
strings
0 references
subtree repeats
0 references