Indexy uspořádaných stromů pro podstromy a stromové vzorky a jejich prostorové složitosti
On Indexes of Ordered Trees for Subtrees and Tree Patterns and Their Space Complexities
Typ dokumentu
disertační prácedoctoral thesis
Autor
Poliak Martin
Vedoucí práce
Janoušek Jan
Oponent práce
Pokorný Jaroslav
Studijní obor
InformatikaStudijní program
InformatikaInstituce přidělující hodnost
katedra teoretické informatikyObhájeno
2018-04-06Práva
A university thesis is a work protected by the Copyright Act. Extracts, copies and transcripts of the thesis are allowed for personal use only and at one?s own expense. The use of thesis should be in compliance with the Copyright Act http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf and the citation ethics http://knihovny.cvut.cz/vychova/vskp.htmlVysokoškolská závěrečná práce je dílo chráněné autorským zákonem. Je možné pořizovat z něj na své náklady a pro svoji osobní potřebu výpisy, opisy a rozmnoženiny. Jeho využití musí být v souladu s autorským zákonem http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf a citační etikou http://knihovny.cvut.cz/vychova/vskp.html
Metadata
Zobrazit celý záznamAbstrakt
This doctoral thesis deals with methods of indexing of a tree for subtrees and for tree patterns. Two types of indexes are considered. The first type is the index of a tree for subtrees, i.e. a full index that accepts all subtrees of a given tree. The second type is the index of a tree for tree patterns, i.e. a full index that accepts all tree patterns that match a given tree at any of its nodes. The results of the doctoral thesis are divided into three parts. As the first result, this doctoral thesis presents a deterministic pushdown automaton called tree compression automaton (TCA), which can be used for multiple purposes. Firstly, as an index of the subject tree(s) for subtrees. Secondly, as a subtree matcher. Thirdly, TCA can be used for computing subtree repeats. Lastly, it can be used for compression of indexed tree(s). A conversion algorithm from a TCA to a finite tree automaton (FTA) [18] is given. As the second result, this doctoral thesis presents a linear-space index of a tree for tree patterns. A fast searching algorithm that uses this index is given. It is shown that the presented index, together with the searching algorithm, is an efficient simulation of a non-deterministic tree pattern pushdown automaton, which accepts all tree patterns that match a given tree. As the third result, this doctoral thesis investigates the space complexities of deterministic finite tree automata and deterministic tree pattern pushdown automata. Both automata that represent an index of a tree for tree patterns and they have non-deterministic variants with linear size. This text shows that there exist trees such that any deterministic finite tree automaton used as an index of these trees for tree patterns has size exponential with respect to the indexed trees. A related result is demonstrated for deterministic tree pattern PDAs. The results are a part of arbology research [50]. Arbology is an algorithmic discipline dealing with processing of trees that bases its approach on pushdown automata. This doctoral thesis deals with methods of indexing of a tree for subtrees and for tree patterns. Two types of indexes are considered. The first type is the index of a tree for subtrees, i.e. a full index that accepts all subtrees of a given tree. The second type is the index of a tree for tree patterns, i.e. a full index that accepts all tree patterns that match a given tree at any of its nodes. The results of the doctoral thesis are divided into three parts. As the first result, this doctoral thesis presents a deterministic pushdown automaton called tree compression automaton (TCA), which can be used for multiple purposes. Firstly, as an index of the subject tree(s) for subtrees. Secondly, as a subtree matcher. Thirdly, TCA can be used for computing subtree repeats. Lastly, it can be used for compression of indexed tree(s). A conversion algorithm from a TCA to a finite tree automaton (FTA) [18] is given. As the second result, this doctoral thesis presents a linear-space index of a tree for tree patterns. A fast searching algorithm that uses this index is given. It is shown that the presented index, together with the searching algorithm, is an efficient simulation of a non-deterministic tree pattern pushdown automaton, which accepts all tree patterns that match a given tree. As the third result, this doctoral thesis investigates the space complexities of deterministic finite tree automata and deterministic tree pattern pushdown automata. Both automata that represent an index of a tree for tree patterns and they have non-deterministic variants with linear size. This text shows that there exist trees such that any deterministic finite tree automaton used as an index of these trees for tree patterns has size exponential with respect to the indexed trees. A related result is demonstrated for deterministic tree pattern PDAs. The results are a part of arbology research [50]. Arbology is an algorithmic discipline dealing with processing of trees that bases its approach on pushdown automata.
Zobrazit/ otevřít
Kolekce
Související záznamy
Zobrazují se záznamy příbuzné na základě názvu, autora a předmětu.
-
Randomizované indexy pro přibližné vyhledávání v multidimenzionálních polích
Autor: Luboš Krčál; Vedoucí práce: Holub Jan; Oponent práce: Krátký Michal
(České vysoké učení technické v Praze. Vypočetní a informační centrum.Czech Technical University in Prague. Computing and Information Centre., 2022-08-31)Multidimensional data, either in the form of dense arrays, or sparse relational data are a common data structure for effective storage, access, management, querying, disseminating, analysis, and visualization of scientific ... -
Vyhledávání CRISPR segmentů využívající self-index
Autor: Cvacho Ondřej; Vedoucí práce: Holub Jan; Oponent práce: Procházka Petr
(České vysoké učení technické v Praze. Vypočetní a informační centrum.Czech Technical University in Prague. Computing and Information Centre., 2016-05-10)Práce se zaměřuje na využití kompaktních datových struktur v hledání CRISPR segmentů za použití self-indexů. Hledání CRISPR segmentů je srovnatelné s přibližným vyhledáváním řetězce za pomoci generování a vyhledávání všech ... -
Analýza paralelních mikroelektrodových záznamů
Autor: Vošmik Jiří; Vedoucí práce: Sieger Tomáš; Oponent práce: Spilka Jiří
(České vysoké učení technické v Praze. Vypočetní a informační centrum.Czech Technical University in Prague. Computing and Information Centre., 2018-01-09)Lidský mozek je jedna z nejkomplikovanějších známých struktur a jako takový je dlouhodobě zkoumán. Většina výzkumu mozku se zatím zabývala výzkumem chování celých populací neuronů. Detailní výzkum chování jednotlivých ...