Tree template matching in unranked ordered trees

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F13%3A00204991" target="_blank" >RIV/68407700:21240/13:00204991 - isvavai.cz</a>

Result on the web

<a href="http://www.sciencedirect.com/science/article/pii/S1570866713000026" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1570866713000026</a>

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Tree template matching in unranked ordered trees

Original language description

We consider the problem of tree template matching, a type of tree pattern matching, where the tree templates have some of their leaves denoted as ?don?t care?, and propose a solution based on the bottom-up technique.

Czech name

—

Czech description

—

Type

J_x - 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

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

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

Name of the periodical

Journal of Discrete Algorithms

ISSN

1570-8667

e-ISSN

—

Volume of the periodical

20

Issue of the periodical within the volume

May

Country of publishing house

DE - GERMANY

Number of pages

10

Pages from-to

51-60

UT code for WoS article

—

EID of the result in the Scopus database

—