Forward linearised tree pattern matching using tree pattern border array
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00375772" target="_blank" >RIV/68407700:21240/24:00375772 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.dam.2024.03.014" target="_blank" >https://doi.org/10.1016/j.dam.2024.03.014</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2024.03.014" target="_blank" >10.1016/j.dam.2024.03.014</a>
Alternative languages
Result language
angličtina
Original language name
Forward linearised tree pattern matching using tree pattern border array
Original language description
We define a tree pattern border array as a property of linearised trees analogous to border arrays from the string domain. We consider tree patterns with node wildcards and subtree wildcards. Then we use the tree pattern border array in a new forward tree pattern matching algorithm for ordered ranked trees. The algorithm finds all occurrences of a single linearised tree pattern in a linearised input tree. As with the classical Morris–Pratt algorithm for searching in strings, the tree pattern border array is used to determine shift lengths in the searching phase of the tree pattern matching algorithm. We compare this new algorithm with the best performing previously existing algorithms based on backward linearised tree pattern matching algorithms, (non-)linearised tree pattern matching algorithms using finite tree automata or stringpath matchers. We show that our new algorithm outperforms other tree pattern matching algorithms in single tree pattern matching.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Applied Mathematics
ISSN
0166-218X
e-ISSN
1872-6771
Volume of the periodical
352
Issue of the periodical within the volume
July
Country of publishing house
AT - AUSTRIA
Number of pages
11
Pages from-to
33-43
UT code for WoS article
001223885500001
EID of the result in the Scopus database
2-s2.0-85189432321