Computing all subtree repeats in ordered trees

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F12%3A00196584" target="_blank" >RIV/68407700:21240/12:00196584 - isvavai.cz</a>

Result on the web

<a href="http://www.sciencedirect.com/science/journal/00200190/112/24" target="_blank" >http://www.sciencedirect.com/science/journal/00200190/112/24</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ipl.2012.09.001" target="_blank" >10.1016/j.ipl.2012.09.001</a>

Result language

angličtina

Original language name

Computing all subtree repeats in ordered trees

Original language description

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 proposedalgorithm 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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2012

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Information Processing Letters

ISSN

0020-0190

e-ISSN

—

Volume of the periodical

112

Issue of the periodical within the volume

24

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

5

Pages from-to

958-962

UT code for WoS article

000310662300006

EID of the result in the Scopus database

—