Computing all subtree repeats in ordered trees

DOI10.1016/J.IPL.2012.09.001MaRDI QIDQ1941702zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

treesstringssubtree repeats

Mathematics Subject Classification ID

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

Recommendations

• An optimal algorithm for computing all subtree repeats in trees
• An optimal algorithm for computing all subtree repeats in trees
• On finding common subtrees
• A note on the subtree isomorphism for ordered trees and related problems
• An efficient algorithm for some tree matching problems

Cites work

• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Algorithms for pattern matching and discovery in RNA secondary structure
• An optimal algorithm for computing the repetitions in a word
• Arbology: Trees and Pushdown Automata
• On finding common subtrees
• Programming with Equations
• Tree automata for code selection
• Variations on the Common Subexpression Problem

Cited in

(3)

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

This page was built for publication: Computing all subtree repeats in ordered trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941702)