About: Searching in Tree Structures     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • This project focuses on a new research area called Arbology. This area of research is directly similar and analogous to stringology, which focuses on string problems, such as the string pattern matching problem only this time the string patterns and the subject text are replaced by tree patterns and the subject tree. The vast majority of programming languages are based on context-free grammars, and thus the generated source codes are context-free languages which can be represented by tree structures. This gives us the opportunity to effectively analyze source codes at syntax level using algorithms based on tree searching. With the use of appropriate algorithms it is possible to compare source codes, optimize source code or transform one source code to another by finding the minimal number of edit operations necessary for the transformation. The main purpose of this project is to propose algorithms for exact pattern matching in tree structures.
  • This project focuses on a new research area called Arbology. This area of research is directly similar and analogous to stringology, which focuses on string problems, such as the string pattern matching problem only this time the string patterns and the subject text are replaced by tree patterns and the subject tree. The vast majority of programming languages are based on context-free grammars, and thus the generated source codes are context-free languages which can be represented by tree structures. This gives us the opportunity to effectively analyze source codes at syntax level using algorithms based on tree searching. With the use of appropriate algorithms it is possible to compare source codes, optimize source code or transform one source code to another by finding the minimal number of edit operations necessary for the transformation. The main purpose of this project is to propose algorithms for exact pattern matching in tree structures. (en)
Title
  • Searching in Tree Structures
  • Searching in Tree Structures (en)
skos:prefLabel
  • Searching in Tree Structures
  • Searching in Tree Structures (en)
skos:notation
  • RIV/68407700:21240/10:00166075!RIV11-MSM-21240___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • V
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 286575
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21240/10:00166075
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • tree; tree pattern; subtree; tree pattern matching; pushdown automata (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [71F0F38C2764]
http://linked.open...v/mistoKonaniAkce
  • Praha
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...i/riv/nazevZdroje
  • Workshop 2010
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Flouri, Tomáš
  • Melichar, Bořivoj
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • České vysoké učení technické v Praze
https://schema.org/isbn
  • 978-80-01-04513-8
http://localhost/t...ganizacniJednotka
  • 21240
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software