Skip to Main content Skip to Navigation
Journal articles

Computing all subtree repeats in ordered trees

Abstract : We consider the problem of computing all subtree repeats in a given labeled ordered tree. We first transform the tree to a string representing its postfix notation, and then present an algorithm based on the bottom-up technique to solve it. The proposed algorithm consists of two phases: the preprocessing phase and the phase where all subtree repeats are computed. The linear time and space complexity of the proposed algorithm are important parts of its quality.
Document type :
Journal articles
Complete list of metadata
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Friday, June 21, 2013 - 6:26:54 PM
Last modification on : Saturday, June 25, 2022 - 11:09:21 AM



Michalis Christou, Maxime Crochemore, Tomas Flouri, Costas Iliopoulos, Jan Janousek, et al.. Computing all subtree repeats in ordered trees. Information Processing Letters, Elsevier, 2012, 112 (24), pp.958-962. ⟨10.1016/j.ipl.2012.09.001⟩. ⟨hal-00836959⟩



Record views