Filters
String Suffix Automata and Subtree Pushdown Automata
operations results in new subtree pushdown automata, which accept all subtrees in their properties. The deterministic subtree pushdown automaton accepts an input subtree in time linear to the number of nodes of ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
RECOGNISING THE OVERLAP GRAPHS OF SUBTREES OF RESTRICTED TREES IS HARD
The article shows several hardness results related to the recognition of special subclasses of subtree overlap graphs.
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees
Oracle modification of subtree pushdown automata for ranked and unranked ordered trees is presented. Subtree pushdown automata [1] represent a complete index of a tree for subtrees. Subtree oracle pushdown automata...
IN - Informatika
- 2011 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Tree Indexing by Pushdown Automata and Repeats of Subtrees
We consider the problem of finding all subtree repeats in a given unranked ordered tree.We show a new, elegant, and simple method, which is based on the construction of a tree indexing structure called the subtree pushdown automaton...
IN - Informatika
- 2011 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Subtree Matching by Deterministic Pushdown Automata
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to ...
IN - Informatika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Aho-Corasick like multiple subtree matching by deterministic pushdown automata
Aho-Corasick like multiple subtree matching by deterministic pushdown automata.
IN - Informatika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
Combining Subtree and Ripple Crossover in Grammatical Evolution
with a more traditional subtree crossover. Its results suggest that using subtree the subtree crossover in the initial phases, and switches to the ripple crossover in later......
JC - Počítačový hardware a software
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Structure Aware Two Point Crossover for Grammatical Evolution
This paper proposes and experimentally evaluate so-called structure aware crossover for the Grammatical Evolution (GE). The crossover preserves subtrees in the translated genomes. The structure aware crossover operators draw on the fact that...
JC - Počítačový hardware a software
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Computing all subtree repeats in ordered trees
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 ...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Computing All Subtree Repeats in Ordered Ranked Trees
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 wh...
IN - Informatika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 56