Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00204992" target="_blank" >RIV/68407700:21240/14:00204992 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2013.07.018" target="_blank" >http://dx.doi.org/10.1016/j.dam.2013.07.018</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2013.07.018" target="_blank" >10.1016/j.dam.2013.07.018</a>
Alternative languages
Result language
angličtina
Original language name
Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
Original language description
A pushdown automata based algorithm for searching all occurrences of a tree pattern in a rooted directed labelled ordered subject tree is presented. The algorithm allows tree pattern matching with don't care symbols and with multiple patterns. Further, aconstruction and practical evaluation of a simulation algorithm of pushdown automata based tree pattern matching is described.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-03253S" target="_blank" >GA13-03253S: Text and Tree Structures Processing and Their Applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
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
—
Volume of the periodical
163
Issue of the periodical within the volume
3
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
9
Pages from-to
343-351
UT code for WoS article
000330084200013
EID of the result in the Scopus database
—