Tree-Based 2D Indexing

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00187960" target="_blank" >RIV/68407700:21240/11:00187960 - isvavai.cz</a>
Result on the web
<a href="http://www.worldscinet.com/ijfcs/22/preserved-docs/2208/S0129054111009100.pdf" target="_blank" >http://www.worldscinet.com/ijfcs/22/preserved-docs/2208/S0129054111009100.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0129054111009100" target="_blank" >10.1142/S0129054111009100</a>

Result language
angličtina
Original language name
Tree-Based 2D Indexing
Original language description
A new approach to the 2D pattern matching and specifically to 2D text indexing is proposed. A transformation of a 2D text into the form of a tree is presented. It preserves the context of each element of the 2D text. The tree can be linearised using theprefix notation into the form of a string (a linear text) and the pattern matching is performed in this text. Pushdown automata indexing the 2D text are constructed over the tree representation. They allow to search for 2D prefixes, 2D suffixes, and 2D factors of the 2D text in time proportional to the size of the representation of a 2D pattern. This result achieves the properties analogous to the results obtained in tree pattern matching and string indexing.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - 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
Z - Vyzkumny zamer (s odkazem do CEZ)

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

Similar results(10)