Computing all subtree repeats in ordered trees

DOI10.1016/j.ipl.2012.09.001zbMath1259.68247OpenAlexW2146620962WikidataQ61677867 ScholiaQ61677867MaRDI QIDQ1941702

Costas S. Iliopoulos, Solon P. Pissis, Jan Janoušek, Bořivoj Melichar, Michalis Christou, Maxime Crochemore, Tomáš Flouri

Publication date: 21 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.09.001

zbMATH Keywords

stringstreessubtree repeats

Mathematics Subject Classification ID

Trees (05C05) Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items

An optimal algorithm for computing all subtree repeats in trees ⋮ Trees with large numbers of subtrees

Cites Work

• Unnamed Item
• An optimal algorithm for computing the repetitions in a word
• On finding common subtrees
• Tree automata for code selection
• Algorithms for pattern matching and discovery in RNA secondary structure
• Arbology: Trees and Pushdown Automata
• Variations on the Common Subexpression Problem
• Programming with Equations