Computing All Subtree Repeats in Ordered Ranked Trees

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00192112" target="_blank" >RIV/68407700:21240/11:00192112 - isvavai.cz</a>
Result on the web
<a href="http://www.springerlink.com/content/7766h6564t886082/" target="_blank" >http://www.springerlink.com/content/7766h6564t886082/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-24583-1_33" target="_blank" >10.1007/978-3-642-24583-1_33</a>

Result language
angličtina
Original language name
Computing All Subtree Repeats in Ordered Ranked Trees
Original language description
We consider the problem of finding all subtree repeats in a given ordered ranked tree. Specifically, we transform the given tree to a string representing its postfix notation, and then propose an algorithm based on the bottom-up technique. The proposed algorithm is divided into two phases: the preprocessing phase, and the phase where all subtree repeats are computed. The linear runtime of the algorithm, as well as the use of linear auxiliary space, are important aspects of its quality.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)