Home > Search Results: recid:482104
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 

Warning: Requested record does not seem to exist.
Compact directed acyclic word graph in a sliding window
 Filip, Ondřej ; Dvořák, Tomáš (advisor) ; Senft, Martin (referee)
Compact directed acyclic word graph (CDAWG) is the space-efficient version of a text-indexing data structure called suffix tree. The goal of this work is an implementation and comparison of algorithms constructing CDAWG for text in a sliding window. Sliding window is favorable in cases when the index structure cannot be kept in memory for the whole indexed data. One exact move of the sliding window may be performed in linear time with respect to the length of the window. An approximative algorithm requiring only amortized constant time per one move has been developed, too. However, in this thesis, the correctness of this algorithm has been disproved.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English